Sciweavers

776 search results - page 154 / 156
» Language Constructs for Structured Parallel Programming
Sort
View
CF
2005
ACM
13 years 11 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
ICS
2007
Tsinghua U.
14 years 3 months ago
Optimization of data prefetch helper threads with path-expression based statistical modeling
This paper investigates helper threads that improve performance by prefetching data on behalf of an application’s main thread. The focus is data prefetch helper threads that lac...
Tor M. Aamodt, Paul Chow
ASM
2004
ASM
14 years 2 months ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
SPAA
2009
ACM
14 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 1 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang