Sciweavers

555 search results - page 58 / 111
» Improved results for a memory allocation problem
Sort
View
PARA
2004
Springer
15 years 3 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
SRDS
1999
IEEE
15 years 2 months ago
Logging and Recovery in Adaptive Software Distributed Shared Memory Systems
Software distributed shared memory (DSM) improves the programmability of message-passing machines and workclusters by providing a shared memory abstract (i.e., a coherent global a...
Angkul Kongmunvattana, Nian-Feng Tzeng
ICS
1999
Tsinghua U.
15 years 2 months ago
Reducing cache misses using hardware and software page placement
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
Timothy Sherwood, Brad Calder, Joel S. Emer
ICDCS
1996
IEEE
15 years 2 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 3 months ago
One-pass computation-aware motion estimation with adaptive search strategy
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
Yu-Wen Huang, Chia-Lin Lee, Ching-Yeh Chen, Liang-...