Sciweavers

948 search results - page 51 / 190
» Analysis of SITA policies
Sort
View
ACMSE
2005
ACM
15 years 3 months ago
Exploring communication overheads and locking policies in a peer-to-peer synchronous collaborative editing system
In this paper, we describe recent work in developing a peer-topeer collaborative environment. The study examines various locking mechanisms/policies by adjusting the granularity o...
Jon A. Preston, Sushil K. Prasad
CLUSTER
2004
IEEE
15 years 1 months ago
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
ISF
2007
69views more  ISF 2007»
14 years 9 months ago
Assessing the UK policies for broadband adoption
Broadband technology has been introduced to the business community and the public as a rapid way of exploiting the Internet. The benefits of its use (fast reliable connections, an...
Jyoti Choudrie, Anastasia Papazafeiropoulou
BROADNETS
2007
IEEE
15 years 1 months ago
Energy-efficient transmission for multimedia streams in last-hop wireless internet
Multimedia applications have unique characteristics that can be leveraged to design energy-efficient loss recovery mechanisms. Given their loss tolerance and strict timing requirem...
Albert F. Harris III, Robin Snader, Robin Kravets
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri