333 search results - page 25 / 67 » Automatic Generation of Parallel Treebanks |
PARA
2004
Springer
14 years 28 days ago
2004
Springer
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...
ISPAN
2002
IEEE
14 years 15 days ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
ICCS
2004
Springer
14 years 29 days ago
2004
Springer
We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications follow some commonly used algorithmic skeletons, we id...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper presents the Pure/Epos approach to deal with the high complexity of adaptable operating systems and also to diminish the distance between application and operating syste...
OSDI
1994
ACM
13 years 9 months ago
1994
ACM
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...