Sciweavers

835 search results - page 42 / 167
» On optimal slicing of parallel programs
Sort
View
ISHPC
2003
Springer
14 years 27 days ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
ICS
1993
Tsinghua U.
13 years 11 months ago
The Effectiveness of Decoupling
This paper examines the effectiveness of decoupling as an optimization technique for high-performance computer architectures. Decoupled access execute architectures are described,...
Peter L. Bird, Alasdair Rawsthorne, Nigel P. Topha...
ICPP
1998
IEEE
13 years 12 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
IPPS
2000
IEEE
14 years 2 days ago
PDRS: A Performance Data Representation System
We present the design and development of a Performance Data Representation System (PDRS) for scalable parallel computing. PDRS provides decision support that helps users find the r...
Xian-He Sun, Xingfu Wu
ICPR
2000
IEEE
14 years 2 days ago
Transparent Parallel Image Processing by way of a Familiar Sequential API
This paper describes an infrastructure that enables transparent development of image processing software for parallel computers. The infrastructure’s main component is an image ...
Frank J. Seinstra, Dennis Koelma