108 search results - page 3 / 22 » A Lower Bound for Dynamic Scheduling of Data Parallel Progra... |
156
Voted
ICALP
1994
Springer
15 years 6 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
92
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
131
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
119
Voted
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
116
Voted
TPDS
1998
15 years 2 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...