Sciweavers

822 search results - page 18 / 165
» Contention in shared memory algorithms
Sort
View
MOBIHOC
2004
ACM
14 years 1 months ago
Market sharing games applied to content distribution in ad-hoc networks
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni,...
VLDB
1994
ACM
101views Database» more  VLDB 1994»
13 years 11 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
ICAC
2005
IEEE
14 years 1 months ago
Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
Gokul Soundararajan, Kaloian Manassiev, Jin Chen, ...
DSN
2007
IEEE
14 years 1 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
13 years 9 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath