147 search results - page 6 / 30 » A Distributed and Oblivious Heap |
ISPAN
2002
IEEE
14 years 20 days ago
2002
IEEE
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—Today’s large campus and enterprise networks are characterized by their complexity, i.e. containing thousands of hosts, and diversity, i.e. with various applications and usage...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
IPPS
1999
IEEE
14 years 1 days ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...