Sciweavers

1189 search results - page 99 / 238
» Minimizing churn in distributed systems
Sort
View
HCW
1998
IEEE
14 years 1 months ago
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...
Muthucumaru Maheswaran, Howard Jay Siegel
ICASSP
2010
IEEE
13 years 9 months ago
NC node selection game in collaborative streaming systems
Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distribute...
Nikolaos Thomos, Hyunggon Park, Eymen Kurdoglu, Pa...
PE
2006
Springer
111views Optimization» more  PE 2006»
13 years 9 months ago
How many servers are best in a dual-priority M/PH/k system?
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
Adam Wierman, Takayuki Osogami, Mor Harchol-Balter...
ICDCS
2008
IEEE
14 years 3 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
LCN
2002
IEEE
14 years 1 months ago
A First Look at Wired Sensor Networks for Video Surveillance Systems
Sensor networks are a major new area of research. Some sensor applications, such as video surveillance, will need to be tethered for reasons of bandwidth and power requirements. T...
Vijay Chandramohan, Kenneth J. Christensen