@inproceedings{d960bb43b2c949dd97f56d4340504064,
title = "Processor scheduling in multiprocessor systems",
abstract = "Processor scheduling in multiprocessor systems can be divided into two steps. The first step, referred to as the processor allocation problem, is to determine the number of processors to be allocated to a job so as to maximize the system throughput and processor utilization. This depends both on the load on the system and on certain inherent characteristics of the job — most importantly how efficiently the job can utilize a given number of processors. The second step, referred to as the processor assignment problem, assigns processors to the parallel tasks in a job so as to minimize the execution time on the allocated processors. The processor assignment depends on the number of processor allocated, the processor interconnection structure, and the precedence relationship among the tasks in the job. This paper reviews the various issues in the above two steps of the processor scheduling.",
author = "Tripathi, \{Satish K.\} and Giuseppe Serazzi and Dipak Ghosal",
note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 1st International ACPC Conference on Parallel Computation, 1991 ; Conference date: 30-09-1991 Through 02-10-1991",
year = "1992",
doi = "10.1007/3-540-55437-8\_82",
language = "English",
isbn = "9783540554370",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "208--225",
editor = "Zima, \{Hans P.\}",
booktitle = "Parallel Computation - 1st International ACPC Conference, Proceedings",
address = "Germany",
}