Sciweavers

139 search results - page 18 / 28
» Constructive and Adaptable Distributed Shared Memory
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 29 days 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
CCGRID
2002
IEEE
14 years 13 days ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz
MM
2004
ACM
157views Multimedia» more  MM 2004»
14 years 27 days ago
Everyday cinema
Stories make our experiences memorable over time. In constructing and sharing our personal and communal memories, we move in a reflective manner back and forth between our lifewor...
Aisling Kelliher
INFOCOM
2008
IEEE
14 years 1 months ago
Run-Time System for Scalable Network Services
Sophisticated middlebox services–such as network monitoring and intrusion detection, DDoS mitigation, worm scanning, XML parsing and protocol transformation–are becoming incre...
Upendra Shevade, Ravi Kokku, Harrick M. Vin
IPPS
1997
IEEE
13 years 11 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...