Sciweavers

844 search results - page 162 / 169
» Caching in Networks
Sort
View
CLUSTER
2004
IEEE
14 years 1 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
CN
2002
82views more  CN 2002»
13 years 9 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
NOMS
2010
IEEE
172views Communications» more  NOMS 2010»
13 years 8 months ago
ROCS: a remotely provisioned OSGi framework for ambient systems
—One of the challenges of ambient systems lies in providing all the available services of the environment to the ambient devices, even if they do not physically host those servic...
Stéphane Frénot, Noha Ibrahim, Fr&ea...
ISCA
2007
IEEE
182views Hardware» more  ISCA 2007»
14 years 3 months ago
Configurable isolation: building high availability systems with commodity multi-core processors
High availability is an increasingly important requirement for enterprise systems, often valued more than performance. Systems designed for high availability typically use redunda...
Nidhi Aggarwal, Parthasarathy Ranganathan, Norman ...
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 9 months ago
On entropy for mixtures of discrete and continuous variables
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
Chandra Nair, Balaji Prabhakar, Devavrat Shah