Sciweavers

445 search results - page 66 / 89
» A Call Abstraction for Component Coordination
Sort
View
JCT
2010
79views more  JCT 2010»
14 years 10 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 6 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
ICN
2005
Springer
15 years 5 months ago
Load Distribution Performance of the Reliable Server Pooling Framework
Abstract. The Reliable Server Pooling (RSerPool) protocol suite currently under standardization by the IETF is designed to build systems providing highly available services by prov...
Thomas Dreibholz, Erwin P. Rathgeb, Michael Tü...
IJSEKE
2006
99views more  IJSEKE 2006»
14 years 11 months ago
Weaving Deployment Aspects into Domain-specific Models
pecific models increase the level of abstraction used to develop large-scale component-based systems. Model-driven development (MDD) approaches (e.g., ModelIntegrated Computing and...
Krishnakumar Balasubramanian, Aniruddha S. Gokhale...
SAG
2004
Springer
15 years 5 months ago
A Framework for the Design and Reuse of Grid Workflows
Grid workflows can be seen as special scientific workflows involving high performance and/or high throughput computational tasks. Much work in grid workflows has focused on improvi...
Ilkay Altintas, Adam Birnbaum, Kim Baldridge, Wibk...