Abstract
This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only “one” processor whenever it is in processing. In our multiprocessor task scheduling problem, tasks can require more than one processor at a time for their processing, that is, tasks in our problem require simultaneously “ j” arbitrary processors when they start to be processed, where 1 ≤ j ≤ k and k is a fixed number. Though multiprocessor tasks considered in this paper are assumed to be independent, i.e., the precedence relation does not exist among them, such a problem of scheduling nonpreemptive multiprocessor tasks is NP-complete. Therefore, a heuristic algorithm is investigated for this kind of problem and the worst performance bounds of the algorithm are also derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
