Sciweavers

2595 search results - page 334 / 519
» Addressing Computational Viewpoint Design
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
DAC
1997
ACM
15 years 10 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
ICITS
2011
14 years 10 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
SIGCSE
2010
ACM
186views Education» more  SIGCSE 2010»
16 years 1 months ago
Teaching operating systems using virtual appliances and distributed version control
Students learn more through hands-on project experience for computer science courses such as operating systems, but providing the infrastructure support for a large class to learn...
Oren Laadan, Jason Nieh, Nicolas Viennot
WWW
2010
ACM
16 years 1 months ago
Distributing private data in challenged network environments
Developing countries face significant challenges in network access, making even simple network tasks unpleasant. Many standard techniques—caching and predictive prefetching— ...
Azarias Reda, Brian D. Noble, Yidnekachew Haile