An Analysis of Preemptive Multiprocessor Job Scheduling

The preemptive scheduling of a partially ordered set of tasks is studied. A class of scheduling heuristics is introduced, and the performance of schedules in this class is analyzed with respect to the least finishing time optimality criterion. If there are m processors, then the finishing time of an...

সম্পূর্ণ বিবরণ

গ্রন্থ-পঞ্জীর বিবরন
প্রধান লেখক: Jaffe, Jeffrey M.
প্রকাশিত: 2023
অনলাইন ব্যবহার করুন:https://hdl.handle.net/1721.1/148938