How “hard” is thread partitioning and how “bad” is a list scheduling based partitioning algorithm?
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
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
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Maximizing the Throughput of Multiprocessor Tasks
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Semi-normal Schedulings: Improvement on Goemans' Algorithm
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
On maximizing the throughput of multiprocessor tasks
Theoretical Computer Science
On unit task linear-nonlinear two-cluster scheduling problem
Proceedings of the 2005 ACM symposium on Applied computing
On the Complexity of Adjacent Resource Scheduling
Journal of Scheduling
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
Open block scheduling in optical communication networks
Theoretical Computer Science - Approximation and online algorithms
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
Computers and Operations Research
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal of Scheduling
CAR '09 Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics
Minimum sum multicoloring on the edges of planar graphs and partial k-trees
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
International Journal of Grid and Utility Computing
Discrete optimization with polynomially detectable boundaries and restricted level sets
Journal of Combinatorial Optimization
Scheduling problem with multi-purpose parallel machines
Discrete Applied Mathematics
An online parallel scheduling method with application to energy-efficiency in cloud computing
The Journal of Supercomputing
| Hi-index | 0.05 |