A Fast and Efficient Processor Management Scheme for k-ary n-cubes

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


Job scheduling and processor allocation are two key components of processor management technique in a multiprocessor operating system. We propose a fast and efficient processor management technique, called virtual cube (VC), for k-ary n-cubes in this paper. The proposed scheme supports spatial allocation of jobs to the virtual cubes of the system and multiprograms the virtual cubes in a round-robin fashion. The objective here is to reduce job waiting time and fragmentation. The VC scheme uses a fast subcube allocation algorithm called enhanced k-ary buddy. A novel approach, called paging, is proposed for fast submesh allocation. When used with the first fit algorithm, the paging scheme is shown to be extremely fast and efficient compared to other contemporary submesh allocation algorithms for k-ary n-cubes. We also study the impact of page size on performance and illustrate a methodology to compute optimal page size. Simulation results show that the VC scheme with its multiprogramming capability can boost system performance considerably and outperforms all existing policies while incurring minimal run-time overhead. Copyright 1998 Academic Press.

Document Type: Research Article

Affiliations: 1: Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, California, 94551 2: Department of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania, 16802

Publication date: December 1, 1998

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more