Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Dynamic scheduling on parallel machines
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal online scheduling of parallel jobs with dependencies
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Theoretical Computer Science
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Scheduling on hierarchical clusters using malleable tasks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Parallel scheduling problems in next generation wireless networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scheduling Parallel Applications Using Malleable Tasks on Clusters
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Scheduling Independent Malleable Tasks
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Scheduling malleable tasks with precedence constraints
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
Information and Computation
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
A moldable online scheduling algorithm and its application to parallel short sequence mapping
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
Fast approximation algorithms for scheduling independent multiprocessor tasks
Proceedings of the 19th High Performance Computing Symposia
An approximation algorithm for scheduling malleable tasks under general precedence constraints
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
What to make of multicore processors for reliable real-time systems?
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Hi-index | 0.00 |