Ernest Davis
- 1 BRUNO, J, COFFMAN, E G JR, AND SETHI, R Scheduhng independent tasks to reduce mean finishing time Commun ACM 17, 7 (July 1974), 382-387 Google Scholar
- 2 BRUNO, J, COFFMAN, E G JR., AND SETHI, R Algorithms for mlmmlzmg mean flow time IFIP 74, North-Holland, Amsterdam, 1974, pp 504-510Google Scholar
- 3 GAREY, M R, AND JOHNSON, D S. Computers and Intractablhty A Grade to the Theory of NP- Completeness Freeman, San Francisco, 1979 Google Scholar
- 4 GRAHAM, R L Bounds on multlprocessmg timing anomalies SIAM J. Appl Math 17 (1969), 263-269Google Scholar
- 5 HOROWITZ, E, AND SAHNI, S Exact and approximate algorithms for scheduhng nonidentical processors J ACM 23, 2 (Aprd 1976), 317-327 Google Scholar
- 6 IBARRA, O H, AND KIM, C E Heuristic algorithms for scheduling independent tasks on nonidentical processors J. A CM 24, 2 (April 1977), 280-289 Google Scholar
- 7 JAFFE, J M Bounds on the schedulmg of typed task systems SIAM J Comput 9, 3 (Aug 1980), 541-551Google Scholar
- 8 JAFFE, J.M Efficient scheduhng of tasks without full use of processor resources Theor Comput Scz 12 (1980), 1-17.Google Scholar
- 9 KAFURA, D G., AND SHEN, V Y Task scheduhng on a muluprocessor system with independent memories SIAM J. Comput 6 (March 1977), 167-187Google Scholar
- 10 LAWLER, E L, AND LABETOULLE, J On preemptive scheduhng of unrelated parallel processors by linear programmmg. J ACM 25, 4 (Oct 1978), 612-619 Google Scholar
- 11 LIu, J.W.S., AND LIU, C L Performance analysts of multiprocessor systems containing functionally dedicated processors Acta lnf 10, 1 (1978) 95-104Google Scholar
- 12 SAHNI, S Algorithms for scheduling independent tasks J ACM 23, 1 (Jan. 1976), 116-127 Google Scholar
- 13 SAHNI, S, AND GONZALEZ, T Preemptive scheduling of two unrelated machines Tech Rep 76-16, Computer Science Dep, Unlv of Minnesota, Minneapolis, Mmn, Nov 1976Google Scholar
Index Terms
- Algorithms for Scheduling Tasks on Unrelated Processors
Recommendations
Preemptive and non-preemptive scheduling on two unrelated parallel machines
AbstractIn this paper, for the problem of minimizing the makespan on two unrelated parallel machines we compare the quality of preemptive and non-preemptive schedules. It is known that there exists an optimal preemptive schedule with at most two ...
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well known for uniprocessor platforms and which are also true for unrelated multiprocessor ...
Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors
ISORC '15: Proceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed ComputingExisting real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and ...
Comments