Sciweavers

661 search results - page 18 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
OPODIS
2003
13 years 8 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
IPPS
2006
IEEE
14 years 1 months ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
GROUP
2003
ACM
14 years 20 days ago
Supporting activity-centric collaboration through peer-to-peer shared objects
We describe a new collaborative technology that is mid-way between the informality of email and the formality of shared workspaces. Email and other ad hoc collaboration systems ar...
Werner Geyer, Jürgen Vogel, Li-Te Cheng, Mich...
HICSS
2005
IEEE
170views Biometrics» more  HICSS 2005»
14 years 1 months ago
Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks
— Structured peer-to-peer systems have emerged as infrastructures for resource sharing in large-scale, distributed, and dynamic environments. One challenge in these systems is to...
Ali Ghodsi, Luc Onana Alima, Seif Haridi
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
11 years 9 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li