By Topic

A new processor allocation strategy using ESS (expanding square strategy)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hosseini-Moghaddam, S.M. ; Mashhad Azad Univ., Iran ; Naghibzadeh, M.

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.

Published in:

Parallel, Distributed, and Network-Based Processing, 2006. PDP 2006. 14th Euromicro International Conference on

Date of Conference:

15-17 Feb. 2006