Project Title: Analysis and Implementation of a System for Parameters Measuring and Operation Controlling of Automotive Diesel Engines
Start Date: ongoing
End Date:
URL: http://www.disca.upv.es/gstf/
CaberNet members involved on the project: Universidad Politécnica de Valencia, Spain
Other Partners:
The Project:
The objective of this project is to design an open architecture for the control of a diesel engine in a benchmark laboratory.
List of relevant chapters:
Software Architectures for Distributed and Dependable Systems
Three publications reporting outcomes from the project
Network of Excellence in Distributed and Dependable Computing Systems
Acronym:
Project Title: Analysis of Replication Techniques
Start Date: February 2000
End Date: May 2003
URL:
CaberNet members involved on the project: EPFL, Switzerland
Other Partners:
The Project:
The goal of the project is to analyse the efficiency of various group communication algorithms developed in a time-free model. The efficiency of these algorithms will be measured in terms of latency and throughput. Latency and throughput can be obtained by implementation. However, in this case the results depend on a specific environment. For this reason the goal of the project is also to find an adequate model for estimating the cost of group communication algorithms, allowing analytical cost estimation, or cost estimation based on simulation.
List of relevant chapters:
Group Communication
Three publications reporting outcomes from the project
P. Urban, X. Defago, A. Schiper Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms Proc. 9th IEEE Int. Conf. on Computer Communications and Networks (ICCCN), pp 582-589, October 2000.
Coccoli, P. Urban, A. Bondavalli, A. Schiper Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements Proc IEEE Int. Conf on Dependable Systems & Networks (DSN), pp 551-560, June 2002.
P. Urban, I. Shnayderman, A. Schiper Comparison of Failure Detector and Group Membership: Performance Study of Two Atomic Broadcast Algorithms Proc IEEE Int. Conf on Dependable Systems & Networks (DSN), pp 645-654, June 2003.
Network of Excellence in Distributed and Dependable Computing Systems
Acronym:
Project Title: Anthill
Start Date: 2001
End Date: ongoing
URL: http://www.cs.unibo.it/projects/anthill/
CaberNet members involved on the project: Università di Bologna, Italy
Other Partners: Department of Telematics, Norwegian University of Science and Technology, Trondheim, Norway
The Project: Anthill is a framework aimed at supporting the design, development and analysis of peer-to-peer (P2P) protocols and algorithms. Anthill is based on the multi-agent systems (MAS) paradigm. The aim is to integrate paradigms and techniques inspired by natural and artificial complex adaptive systems in order to improve the robustness and the efficiency of P2P applications.
List of relevant chapters:
Mobile Agents
Three publications reporting outcomes from the project
Ozalp Babaoglu, Hein Meling, Alberto Montresor. Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems. In Proc. of the 22th International Conference on Distributed Computing Systems (ICDCS '02), Vienna, Austria, July 2002.
Alberto Montresor, Heing Meling, Ozalp Babaoglu. Messor: Load-Balancing through a Swarm of Autonomous Agents. In Proc. of the 1st International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italia, July 2002.
Alberto Montresor, Heing Meling, Ozalp Babaoglu. Towards Self-Organizing, Self-Repairing and Resilient Large-Scale Distributed Systems. In "Future Directions in Distributed Computing". Lectures Notes of Computer Science, 2584, 2003.
Network of Excellence in Distributed and Dependable Computing Systems
Acronym:
Project Title: Automated Verification of Probabilistic Protocols with PRISM
Start Date: 2003
End Date: 2006
URL: www.cs.bham.ac.uk/~mzk/prismprot
CaberNet members involved on the project: University of Birmingham, UK
Other Partners:
The Project: This EPSRC-funded project (grant GR/S11107) aims to extend and develop the probabilistic verification tool PRISM to improve its support for verification of probabilistic protocols. Probabilistic protocols employ a random element, such as a random number generator or a stream of random bits, in order to arrive at simple, elegant and fast algorithmic solutions to a variety of distributed coordination problems. Real-world examples include leader election in IEEE 1394 FireWire, Byzantine agreement, multicast protocols (the Spinglass project) and anonymity protocols (Crowds). A necessary consequence of the inclusion of randomness is the increase in complexity of reasoning about correctness of such algorithms, which must combine probabilistic analysis with conventional reasoning.
List of relevant chapters:
Distributed Systems Security, Rigorous Design
Three publications reporting outcomes from the project
M. Kwiatkowska, G. Norman, J. Sproston Probabilistic Model Checking of Deadline Properties in the IEEE1394 FireWire Root Contention Protocol Special Issue of Formal Aspects of Computing, 14:295-318 2003
M. Kwiatkowska, G. Norman, D. Parker PRISM: Probabilistic Symbolic Model Checker In Proc. TOOLS 2002, volume 2324 of LNCS, pages 200-204, Springer-Verlag 2002
Symbolic computation of maximal probabilistic reachability (with M. Kwiatkowska and J. Sproston).In Proc. 13th International Conference on Concurrency Theory (CONCUR'01), LNCS 2154, Springer-Verlag, 2001
Network of Excellence in Distributed and Dependable Computing Systems
Acronym:
Project Title: Automatic Validation of Web Services
Start Date: 2001
End Date: Ongoing
URL:
Share with your friends: |