Sciweavers

483 search results - page 18 / 97
» Timing Games and Shared Memory
Sort
View
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 4 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
VLDB
1997
ACM
140views Database» more  VLDB 1997»
14 years 2 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis
LCR
2000
Springer
129views System Software» more  LCR 2000»
14 years 1 months ago
Run-Time Support for Distributed Sharing in Typed Languages
We present a new run-time system for typed programming languages that supports object sharing in a distributed system. The key insight in this system is that the ability to distin...
Y. Charlie Hu, Weimin Yu, Alan L. Cox, Dan S. Wall...
IPPS
2000
IEEE
14 years 2 months ago
Effective Load Sharing on Heterogeneous Networks of Workstations
We consider networks of workstations which are not only timesharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workst...
Li Xiao, Xiaodong Zhang, Yanxia Qu
JPDC
2006
92views more  JPDC 2006»
13 years 9 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang