Sciweavers

327 search results - page 1 / 66
» Automatic Generation of DAG Parallelism
Sort
View
PLDI
1989
ACM
15 years 1 months ago
Automatic Generation of DAG Parallelism
Ron Cytron, Michael Hind, Wilson C. Hsieh
ISPAN
2002
IEEE
15 years 2 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
ICDCSW
2006
IEEE
15 years 3 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 ...
IPPS
1998
IEEE
15 years 1 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