Sciweavers

15494 search results - page 2665 / 3099
» Computing dynamic clusters
Sort
View
DILS
2005
Springer
16 years 12 days ago
PLATCOM: Current Status and Plan for the Next Stages
We have been developing a system for comparing multiple genomes, PLATCOM, where users can choose genomes of their choice freely and perform analysis of the selected genomes with a...
Kwangmin Choi, Jeong-Hyeon Choi, Amit Saple, Zhipi...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
16 years 11 days ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
IPOM
2005
Springer
16 years 11 days ago
Comprehensive Solution for Anomaly-Free BGP
The Internet consists of many self-administered and inter-connected AutonomousSystems(ASms). ASms exchangeinter-AS routing information with each other via the Border Gateway Protoc...
Ravi Musunuri, Jorge Arturo Cobb
VIZSEC
2005
Springer
16 years 10 days ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
ASPLOS
2004
ACM
16 years 8 days ago
Devirtualizable virtual machines enabling general, single-node, online maintenance
Maintenance is the dominant source of downtime at high availability sites. Unfortunately, the dominant mechanism for reducing this downtime, cluster rolling upgrade, has two short...
David E. Lowell, Yasushi Saito, Eileen J. Samberg
« Prev « First page 2665 / 3099 Last » Next »