204 search results - page 10 / 41 » Provable algorithms for parallel generalized sweep schedulin... |
SIGCOMM
2004
ACM
15 years 2 months ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
CP
2004
Springer
15 years 2 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
120
Voted
WOSP
1998
ACM
15 years 1 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...