Sciweavers

1422 search results - page 150 / 285
» How to measure a large open-source distributed system
Sort
View
IWMM
2000
Springer
84views Hardware» more  IWMM 2000»
15 years 10 months ago
Designing a Trace Format for Heap Allocation Events
Dynamic storage allocation continues to play an important role in the performance and correctness of systems ranging from user productivity software to high-performance servers. W...
Trishul M. Chilimbi, Richard E. Jones, Benjamin G....
ANCS
2008
ACM
15 years 8 months ago
Performing time-sensitive network experiments
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick...
SERP
2004
15 years 7 months ago
Using Clustering Technique to Restructure Programs
Program restructuring or refactoring is often required when a function becomes too large or is involved in multiple activities and therefore exhibits low cohesion. A critical fact...
Chung-Horng Lung, Marzia Zaman
INFOCOM
2010
IEEE
15 years 4 months ago
Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
Elias Kehdi, Baochun Li
ATAL
2009
Springer
16 years 1 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...