42 search results - page 7 / 9 » Asynchronous parallel disk sorting |
107
click to vote
OSDI
2008
ACM
14 years 12 months ago
2008
ACM
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
JAVA
2000
Springer
15 years 1 months ago
2000
Springer
The file I/O classes present in Java have proven too inefficient to meet the demands of high-performance applications that perform large amounts of I/O. The inefficiencies stem pr...
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
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...
74
Voted
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...