204 search results - page 22 / 41 » Provable algorithms for parallel generalized sweep schedulin... |
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
109
click to vote
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
TCAD
2002
14 years 11 months ago
2002
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
108
click to vote
ICLP
2001
Springer
15 years 4 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
129
click to vote
SPAA
1999
ACM
15 years 4 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...