234 search results - page 10 / 47 » Lightweight Task Graph Inference for Distributed Application... |
PVM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Modern parallel and distributed computing solutions are often built onto a “middleware” software layer providing a higher and common level of service between computat...
DCOSS
2005
Springer
14 years 4 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
JSA
2007
13 years 10 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
FCCM
2006
IEEE
14 years 5 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
IPPS
1998
IEEE
14 years 3 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...