Preemptive scheduling of independent jobs on a hypercube
Information Processing Letters
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling independent jobs on partitionable hypercubes
Journal of Parallel and Distributed Computing
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
Journal of Parallel and Distributed Computing
Cesar-FD: An Effective Stateful Fault Detection Mechanism in Drug Discovery Grid
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Performance study of Conillon: a platform for distributed computing
Proceedings of the 2011 Workshop on Open Source and Design of Communication
Parallel search for Ramsey grid colorings
Proceedings of the 50th Annual Southeast Regional Conference
| Hi-index | 14.98 |
We define the master-slave multiprocessor scheduling model in which a master processor coordinates the activities of several slave processors. O(n log n) centralized, deterministic, batch-oriented algorithms are developed for some of the problems formulated. Some others are shown to be NP-hard.