Abstract
Parallel execution of an arrival stream of jobs with and without real-time constraints on a (possibly heterogeneous) multiprocessor system is considered. A job consists of a set of tasks and a partial order specifying the precedence constraints between the tasks. The real-time constraints are specified by due times, also called soft real time deadlines. It is assumed that there is a predefined mapping from the set of tasks onto the set of machines that is identical for all jobs. Associated with each task is a service time that may depend on the machine that it is allocated to. The problem of scheduling tasks into execution at each machine is the subject of this paper
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.
