A New Processor Allocation Strategy Using ESS (Expanding Square Strategy)

This source preferred by Mahmood Hosseini

Authors: Hosseini-Moghaddam, S.M. and Naghibzadeh, M.


Start date: 15 February 2006

Pages: 137-140

Publisher: Institute of Electrical and Electronics Engineers ( IEEE )

ISBN: 9780769525136

ISSN: 1066-6192

DOI: 10.1109/PDP.2006.13

Processor allocation is done using space-sharing or time-sharing techniques. In timesharing techniques, processes are allocated to processors by dividing the time into separate slots, with each slot allocated to a different task. In space-sharing techniques processors are divided into physical partitions and once allocated, processes do not leave the system until they are completed and finished. Early processor allocation techniques were contiguous, in which the processors are constrained to be physically adjacent. These strategies suffered significantly from internal and external fragmentation. Non-contiguous processor allocation strategies have solved the fragmentation problem but have introduced a new problem called message-passing contention. In this article, we propose ESS, which is a new non-contiguous processor allocation strategy on mesh-connected parallel computers. ESS is noncontiguous, and gives a very compact allocation, and thus performs a very successful allocation with minimum contention. Furthermore, ESS is inherently parallelizable.

The data on this page was last updated at 04:42 on September 22, 2017.