36 search results - page 1 / 8 » Oblivious algorithms for multicores and network of processor... |
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
ICALP
2010
Springer
13 years 7 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
ESA
1998
Springer
13 years 9 months ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
Heterogeneous multicore processors promise high execution
efficiency under diverse workloads, and program scheduling is
critical in exploiting this efficiency. This paper present...
ANCS
2008
ACM
13 years 7 months ago
2008
ACM
To build high-performance network devices with holistic security protection, a large number of algorithms have been proposed. However, multi-core implementation of the existing al...