Sciweavers

327 search results - page 1 / 66
» Automatic Generation of DAG Parallelism
Sort
View
123
Voted
PLDI
1989
ACM
15 years 9 months ago
Automatic Generation of DAG Parallelism
Ron Cytron, Michael Hind, Wilson C. Hsieh
203
Voted
ISPAN
2002
IEEE
15 years 10 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
116
Voted
IPPS
2007
IEEE
16 years 3 days ago
Code Generation: On the Scheduling of DAGs Using Worm-Partition
Hatem M. El-Boghdadi, Mohamed Bohalfaeh
132
Voted
ICDCSW
2006
IEEE
15 years 12 months ago
Automatic Subscriptions In Publish-Subscribe Systems
In this paper, we describe how to automate the process of subscribing to complex publish-subscribe systems. We present a proof-of-concept prototype, in which we analyze Web browsi...
Lars Brenna, Cathal Gurrin, Dag Johansen, Dmitrii ...
170
Voted
IPPS
1998
IEEE
15 years 10 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu