Kurt Windisch, Virginia Lo  Home/Search
Context Related
| uoregon.edu/pub/lo/kncube_icpp.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uoregon.edu/research/Di...archive (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Efficient utilization of processing resources in a large, multiuser parallel computer depends on processor allocation algorithms that minimize system fragmentation. We propose three processor allocation algorithms for the k-ary n-cube class of parallel architectures, which includes the hypercube and multidimensional torus. The k-ary Partner strategy is a conventional contiguous processor allocation strategy that improves subcube recognition. The non-contiguous Multiple Buddy and Multiple... (Update)
Similar documents based on text: More All
0.3: Non-contiguous Processor Allocation Algorithms for Distributed.. - Liu (1994) (Correct)
0.3: Subcube Allocation Strategies in a K-ary N-Cube - Vikas Gautam And (1993) (Correct)
0.2: Contiguous and Non-contiguous Processor Allocation Algorithms.. - Windisch, Lo (1995) (Correct)
BibTeX entry: (Update)
K. Windisch, V. Lo, and B. Bose. Contiguous and noncontiguous processor allocation algorithms for k-ary n- cubes. In Proceedings of the International Conference on Parallel Processing, 1995. http://citeseer.ist.psu.edu/windisch95contiguous.html More
@inproceedings{ windisch95contiguous,
author = "K. Windisch and V. Lo and B. Bose",
title = "Contiguous and Non-Contiguous Processor Allocation Algorithms for {\em k}-ary {\em n}-cubes",
booktitle = "Proceedings of the 24th International Conference on Parallel Processing",
address = "Oconomowoc, WI",
pages = "II:164--168",
year = "1995",
url = "citeseer.ist.psu.edu/windisch95contiguous.html" }
Citations (may not include all citations):129 cube interconnection networks (context) - Dally, of - 1990
41 Noncontiguous processor allocation algorithms for distribute.. - Liu, Lo et al. - 1994
41 A two-dimensional buddy system for dynamic resource allocati.. (context) - Li, Cheng - 1991
36 Job scheduling is more important than processor allocation f.. (context) - Krueger, Lai et al. - 1994
17 Lee distance and topological properties of k-ary n-cubes (context) - Bose, Broeg et al. - 1995
17 A new strategy for processor allocation in an n-cube multipr.. (context) - Al-Dhelaan, Bose - 1989
15 cube multiprocessor using gray codes (context) - Chen, Shin et al. - 1987
12 Procsimity: an experimental tool for processor allocation an.. - Windisch, Miller et al. - 1995
8 Contiguous and noncontiguous processor allocation algorithms.. - Windisch, Lo et al. - 1995
4 Efficient processor allocation for 3d tori - Qiao, Ni - 1994
3 Subcube allocation strategies in a k-ary n-cube - Gautam, Chaudhary - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uoregon.edu/research/DistributedComputing/archive.html): More
Contiguous and Non-contiguous Processor Allocation Algorithms.. - Windisch, Lo (1995) (Correct)
A Comparison of Workload Traces from Two Production.. - Windisch, Lo.. (1996) (Correct)
ProcSimity: An Experimental Tool for Processor Allocation.. - Windisch, Miller, Lo (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC