246 search results - page 2 / 50 » Possibility and Impossibility Results in a Shared Memory Env... |
EUROPAR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Profiling is often the method of choice for performance analysis of parallel applications due to its low overhead and easily comprehensible results. However, a disadvanta...
FGCS
2000
13 years 5 months ago
2000
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
IWMM
2011
Springer
12 years 8 months ago
2011
Springer
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
ISMM
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...
ASPLOS
1991
ACM
13 years 8 months ago
1991
ACM
The memory consistency model supported by a multiprocessor architecture determines the amount of buffering and pipelining that may be used to hide or reduce the latency of memory ...