Sciweavers

674 search results - page 86 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
ISPA
2007
Springer
15 years 7 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
HIPC
2004
Springer
15 years 6 months ago
Performance Characteristics of a Cosmology Package on Leading HPC Architectures
Abstract. The Cosmic Microwave Background (CMB) is a snapshot of the Universe some 400,000 years after the Big Bang. The pattern of anisotropies in the CMB carries a wealth of info...
Jonathan Carter, Julian Borrill, Leonid Oliker
GRID
2000
Springer
15 years 5 months ago
Architectural Models for Resource Management in the Grid
: The concept of coupling geographically distributed (high-end) resources for solving large-scale problems is becoming increasingly popular, forming what is popularly called grid c...
Rajkumar Buyya, Steve J. Chapin, David C. DiNucci
CLUSTER
2008
IEEE
15 years 7 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
DEBS
2007
ACM
15 years 3 months ago
Identification of suspicious, unknown event patterns in an event cloud
This paper describes an approach to detect unknown event patterns. In this context, an event is not only something that happens, but also something that can be analysed. This task...
Alexander Widder, Rainer von Ammon, Philippe Schae...