Journal Article10.1016/J.PARCO.2006.11.010
Distributed dynamic processor allocation for multicomputers
César A. F. De Rose,Hans-Ulrich Heiss,Barry Linnert +2 more
- 01 Apr 2007
- Vol. 33, Iss: 3, pp 145-158
TL;DR: Noncontiguous versions of a distributed dynamic processor allocation scheme are proposed and studied in this paper as an alternative for parallel programming models to allow dynamic creation and task deletion and to demonstrate dynamic allocation is feasible with current technologies.
read more
Abstract: Current processor allocation techniques for highly parallel systems use centralized front-end based algorithms which restrict applied strategies to static allocation, low parallelism, and weak fault tolerance. To lift these restrictions, we are investigating a distributed approach to processor allocation in multicomputers where currently no centralized data structure with information about the state of all processors exists. This approach will allow the implementation of more complex allocation schemes and possibly the consideration of dynamic allocation, where parallel applications would be able to adapt the allocated processor partition to its actual demand at running time, resulting in a more efficient utilization of system resources. Noncontiguous versions of a distributed dynamic processor allocation scheme are proposed and studied in this paper as an alternative for parallel programming models to allow dynamic creation and task deletion. Simulations compare the performance of the proposed dynamic strategies with static counterparts and also with well-known centralized algorithms in an environment with growing and shrinking processor demands. To demonstrate dynamic allocation is feasible with current technologies, results of the experiments are presented for a 96 nodes SCI hpcLine Primergy Server cluster.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations
TL;DR: A discrete-time distributed algorithm developed by Euler’s method, converging exponentially to the least squares solution at the node states with suitable step size and graph conditions is developed.
51
Autonomic QoS in ASSIST grid-aware components
Marco Aldinucci,Marco Danelutto,Marco Vanneschi +2 more
- 15 Feb 2006
TL;DR: The ASSIST programming environment is described, the prototype of parallel programming environment currently under development at the group, as a suitable basis to capture all the desired features for QoS control for the grid.
Energy characteristic of a processor allocator and a network-on-chip
TL;DR: Simulation results show that a PA with an IFF allocation algorithm for mesh systems and a torus-based NoC with express-virtual-channel flow control are very energy efficient and combination of these two solutions is a clear choice for modern CMPs.
24
Evaluation Scheme for NoC based CMP with Integrated Processor Management System
TL;DR: Analyzed results reveal that CMP with a PA controlled by IFF allocation algorithm for mesh systems and torus-based NoC driven by DORLB routing with express-virtual-channel flow control achieved the best traffic balance and energy characteristic.
18
Interoperability of Grid component models: GCM and CCA case study
Maciej Malawski,Marian Bubak,Françoise Baude,Denis Caromel,Ludovic Henrio,Matthieu Morel +5 more
- 01 Jan 2007
TL;DR: The implementation and results of investigation of interoperability between two given component frameworks: MOCCA and ProActive are presented and the key concepts useful to make any two component models interoperate are presented.
References
The anatomy of the grid: enabling scalable virtual organizations
Ian Foster
- 28 Aug 2001
TL;DR: The term "the Grid" was coined in the mid-1990s to denote a proposed distributed computing infrastructure for advanced science and engineering but the term has also been conflated, at least in popular perception, to embrace everything from advanced networking to artificial intelligence.
Distributed Algorithms 2020
Juho Hirvonen,Jukka Suomela +1 more
- 01 Jan 2020
TL;DR: This week it is shown that 3-coloring paths requires Ω(log∗ n) rounds, which matches the fast coloring algorithms that the authors saw in Chapter 1.
A survey of wormhole routing techniques in direct networks
Lionel M. Ni,Philip K. McKinley +1 more
TL;DR: The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail, along with a technique that allows multiple virtual channels to share the same physical channel.
1.4K
The Physiology of the Grid
Ian Foster,Ian Foster,Carl Kesselman,Jeffrey M. Nick,Steven Tuecke +4 more
- 30 May 2003
TL;DR: This presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how the architecture can be applied within commercial computing as a basis for distributed system integration.
487
Toward a common component architecture for high-performance scientific computing
Robert C. Armstrong,A. Geist,Kate Keahey,S. Kohn,Lois Curfman McInnes,Steven G. Parker,B. Smolinski +6 more
- 03 Aug 1999
TL;DR: This research stems from the growing recognition that the scientific community needs to better manage the complexity of multidisciplinary simulations and better address scalable performance issues on parallel and distributed architectures.