Task Scheduling in Multiprocessing Systems
| dc.contributor.author | El-Rewini, Hesham | |
| dc.contributor.author | Ali, Hesham H. | |
| dc.contributor.author | Lewis, Ted | |
| dc.contributor.department | Computer Science (CS) | |
| dc.date.accessioned | 2014-05-15T22:49:12Z | |
| dc.date.available | 2014-05-15T22:49:12Z | |
| dc.date.issued | 1995-12 | |
| dc.description.abstract | Jobs needing to be processed in a manufacturing plant, bank customers waiting to be served by tellers, aircraft waiting for landing clearances, and program tasks to be run on a parallel or distributed computer: What do these situations have in common? They all encounter the scheduling problem that emerges whenever there is a choice concerning the order in which tasks can be performed and the assignment of tasks to servers for processing. In general, the scheduling problem assumes a set of resources and a set of consumers serviced by those resources according to a certain policy. The nature of the consumers and resources as well as the constraints on them affect the search for an efficient policy for managing the way consumers access and use the resources to optimize some desired performance measure. Thus, a scheduling system comprises a set of consumers, a set of resources, and a scheduling policy. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10945/41234 | |
| dc.rights | This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States. | en_US |
| dc.title | Task Scheduling in Multiprocessing Systems | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication |
