Scheduling master-slave multiprocessor systems
We define the master-slave multiprocessor scheduling model and provide several applications for the model. O(n log n) algorithms are developed for some of the problems formulated and some others are shown to be NP-hard.
Unable to display preview. Download preview PDF.
- 1.G. Chen and T. Lai, Preemptive scheduling of independent jobs on a hypercube, Information Processing Letters, 28, 201–206, 1988.Google Scholar
- 2.G. Chen and T. Lai, Scheduling independent jobs on partitionable hypercubes, Jr. of Parallel & Distributed Computing, 12, 74–78, 1991.Google Scholar
- 3.P. Krueger, T. Lai, and V. Dixit-Radiya, Job scheduling is more important than processor allocation for hypercube computers, IEEE Trans. on Parallel & Distributed Systems, 5, 5, 488–497, 1994.Google Scholar
- 4.S. Leutenegger and M. Vernon, The performance of multiprogrammed multiprocessor scheduling policies, Proc. 1990 ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, 226–236, 1990.Google Scholar
- 5.S. Majumdar, D. Eager, and R. Bunt, Scheduling in multiprogrammed parallel systems, Proc. 1988 ACM SIGMETRICS, 104–113, 1988.Google Scholar
- 6.C. McCreary, A. Khan, J. Thompson, and M. McArdle, A comparison of heuristics for scheduling DAGS on multiprocessors, 8th International Parallel Processing Symposium, 446–451, 1994.Google Scholar
- 7.S. Sahni, Scheduling multipipeline and multiprocessor computers, IEEE Trans on Computers, C-33, 7, 637–645, 1984.Google Scholar
- 8.Y. Zhu and M. Ahuja, Premptive job scheduling on a hypercube, Proc. 1990 International Conference on Parallel Processing, 301–304, 1990.Google Scholar