761 search results - page 24 / 153 » The art of multiprocessor programming |
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
HPCA
2006
IEEE
16 years 3 days ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
102
click to vote
SEUS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. In this paper we explore the combination of a time-predictable chipmultiprocessor system with the single-path programming paradigm. Time-sliced arbitration of the main me...
122
click to vote
CEC
2005
IEEE
15 years 1 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...