Sciweavers

4155 search results - page 371 / 831
» External Memory Algorithms
Sort
View
ESA
2007
Springer
100views Algorithms» more  ESA 2007»
16 years 1 months ago
Radix Sorting with No Extra Space
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
Gianni Franceschini, S. Muthukrishnan, Mihai Patra...
SPAA
2005
ACM
16 years 1 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
SCCC
1998
IEEE
15 years 11 months ago
Parallel Generation of Inverted Files for Distributed Text Collections
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
Berthier A. Ribeiro-Neto, Joao Paulo Kitajima, Gon...
DPD
2006
98views more  DPD 2006»
15 years 7 months ago
GRACE-based joins on active storage devices
Contemporary long-term storage devices feature powerful embedded processors and sizeable memory buffers. Active Storage Devices (ASD) is the hard disk technology that makes use of ...
Vassilis Stoumpos, Alex Delis
DC
2010
15 years 2 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab