Sciweavers

1422 search results - page 248 / 285
» How to measure a large open-source distributed system
Sort
View
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 3 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
ECRTS
2007
IEEE
15 years 6 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
ICPP
2003
IEEE
15 years 5 months ago
Data Conversion for Process/Thread Migration and Checkpointing
Process/thread migration and checkpointing schemes support load balancing, load sharing and fault tolerance to improve application performance and system resource usage on worksta...
Hai Jiang, Vipin Chaudhary, John Paul Walters
SIGMETRICS
2003
ACM
136views Hardware» more  SIGMETRICS 2003»
15 years 5 months ago
Internet intrusions: global characteristics and prevalence
Network intrusions have been a fact of life in the Internet for many years. However, as is the case with many other types of Internet-wide phenomena, gaining insight into the glob...
Vinod Yegneswaran, Paul Barford, Johannes Ullrich
SPAA
1996
ACM
15 years 4 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick