Sciweavers

190 search results - page 14 / 38
» Resources, Concurrency and Local Reasoning
Sort
View
ICPP
1994
IEEE
13 years 11 months ago
Optimizing IPC Performance for Shared-Memory Multiprocessors
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
Benjamin Gamsa, Orran Krieger, Michael Stumm
SERVICES
2008
103views more  SERVICES 2008»
13 years 8 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
LCR
2000
Springer
118views System Software» more  LCR 2000»
13 years 11 months ago
Run-Time Support for Adaptive Heavyweight Services
By definition, a heavyweight network service requires a significant amount of computation to complete its task. Providing a heavyweight service is challenging for a number of reaso...
Julio C. López, David R. O'Hallaron
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
13 years 7 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...