Approximate algorithms scheduling parallelizable tasks
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 323-332
- https://doi.org/10.1145/140901.141909
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A Heuristic of Scheduling Parallel Tasks and Its AnalysisSIAM Journal on Computing, 1992
- An effective algorithm for parallelizing sort merge joins in the presence of data skewPublished by Association for Computing Machinery (ACM) ,1990
- Complexity of Scheduling Parallel Task SystemsSIAM Journal on Discrete Mathematics, 1989
- Optimal allocation of multiple class resources in computer systemsPublished by Association for Computing Machinery (ACM) ,1988
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- Shelf Algorithms for Two-Dimensional Packing ProblemsSIAM Journal on Computing, 1983
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980
- Discrete Optimization Via Marginal AnalysisManagement Science, 1966