Sciweavers

674 search results - page 103 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
CLUSTER
2006
IEEE
15 years 1 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
ICDCS
1991
IEEE
15 years 4 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
GRID
2003
Springer
15 years 6 months ago
Faults in Grids: Why are they so bad and What can be done about it?
Computational Grids have the potential to become the main execution platform for high performance and distributed applications. However, such systems are extremely complex and pro...
Raissa Medeiros, Walfredo Cirne, Francisco Vilar B...
EDOC
2007
IEEE
15 years 7 months ago
An Enterprise Architecture Alignment Measure for Telecom Service Development
The increasing complexity of modern Information Services (IS) makes necessary to carry on review activities. For many companies, these reviews take place within the framework of t...
Jacques Simonin, Yves Le Traon, Jean-Marc Jé...
EUROPAR
2007
Springer
15 years 7 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu