Sciweavers

1156 search results - page 148 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 2 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
ICPP
1995
IEEE
14 years 17 days ago
Hiding Miss Latencies with Multithreading on the Data Diffusion Machine
— Large parallel computers require techniques to tolerate the potentially large latencies of accessing remote data. Multithreadingis onesuch technique. We extend previous studies...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
CLOUDCOM
2009
Springer
14 years 12 days ago
Decentralized Service Allocation in a Broker Overlay Based Grid
Abstract. Grid computing is based on coordinated resource sharing in a dynamic environment of multi-institutional virtual organizations. Data exchanges, and service allocation, are...
Abdulrahman Azab, Hein Meling
VISSYM
2004
13 years 10 months ago
Isosurface Computation Made Simple
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
Valerio Pascucci
ASPLOS
2006
ACM
14 years 3 months ago
SecCMP: a secure chip-multiprocessor architecture
Security has been considered as an important issue in processor design. Most of the existing mechanisms address security and integrity issues caused by untrusted main memory in si...
Li Yang, Lu Peng