Sciweavers

3229 search results - page 644 / 646
» Mixing
Sort
View
148
Voted
DC
2011
13 years 9 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
105
Voted
PPOPP
2012
ACM
13 years 5 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
CAISE
2004
Springer
15 years 2 months ago
Multi-Paradigm Process Management
Automation and integration of business processes are at the heart of contemporary enterprise systems. In the pursuit of this goal, process automation technology is employed at vary...
Michael zur Muehlen, Michael Rosemann
PLDI
2012
ACM
12 years 12 months ago
Effective parallelization of loops in the presence of I/O operations
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
Min Feng, Rajiv Gupta, Iulian Neamtiu
INFOCOM
2012
IEEE
12 years 12 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...