Sciweavers

473 search results - page 30 / 95
» The Case for Quantum Key Distribution
Sort
View
COR
2006
72views more  COR 2006»
13 years 7 months ago
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
PPOPP
2010
ACM
13 years 6 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
CORR
2010
Springer
63views Education» more  CORR 2010»
13 years 7 months ago
Simplified Distributed Programming with Micro Objects
Developing large-scale distributed applications can be a daunting task. One of the problems that application developers are confronted with is the distribution of data, processes, ...
Jan-Mark S. Wams, Maarten van Steen
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi