Publication

Efficient Object Placement Including Node Selection in a Distributed Virtual Machine

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

DPOR-DS: Dynamic Partial Order Reduction in Distributed Systems

Dejan Kostic, Maysam Yabandeh

In this paper, we present DPOR-DS, an algorithm for dynamic partial order reduction in model checking of distributed systems. This work is inspired by the techniques introduced in the seminal work of DPOR which is designed for multi-threaded systems. Diffe ...

2009

Rethinking the Design of Distributed Stream Processing Systems

Karl Aberer, Ali Salehi

In this paper, we present a novel architecture to support large scale stream processing services in a widely distributed environment. The proposed system, COSMOS, distinguishes itself by its loose coupling and communication efficiency. To exploit the shari ...

IEEE Computer Society2008

Efficient Distributed Subtyping Tests

Rachid Guerraoui, João Barreto, Patrick Eugster

Subtyping tests are essential in typed publish/subscribe infrastructures, especially when the underlying programming language supports subtype conformance, as in Java or C#. These tests are particularly challenging when the publish/subscribe infrastructure ...

2007

Performance Evaluation of Barrier Techniques for Distributed Tracing Garbage Collector

David Atienza Alonso

Currently, software engineering is becoming even more complex due to distributed computing. In this new context, portability is one of the key issues and hence a cluster-aware Java Virtual Machine (JVM) that can transparently execute Java applications in a ...

Jon Von Neumann institute for computing (NIC)2005

Distributed programming with typed events

Rachid Guerraoui, Patrick Eugster

The remote-procedure-call abstraction, including its derivates (underlying, for example, Java RMI, CORBA, and .NET), currently represents one of the most popular paradigms for devising distributed applications. Objects (when acting as servers) are invoked ...

2004

The MOVE System: Monitoring of waste collecting vehicles

Phillip Tomé, Telmo Cunha

Nowadays, efficiency and productivity are fundamental concepts, in any kind of business. Although one can easily accept this as a known fact, one cannot easily identify which steps must be taken to achieve these goals. One approach consists of taking full ...

2003

Issues in Building a Parallel Java Virtual Machine on Cenju-3/DE

Xavier Défago

Issues in Building a Parallel Java Virtual Machine on Cenju-3/DE X. Defago and A. Konagaya This paper describes how a Java virtual machine can use the inherent concurrency of Java programs on a massively parallel processor machine (MPP) like NEC Cenju-3. A ...

1997

Software vs. Hardware Shared Memory Implementation: A Case Study

Willy Zwaenepoel, Sandhya Dwarkadas

We compare the performance of software-supported shared memory on a general-purpose network to hardware-supported shared memory on a dedicated interconnect. Up to eight processors, our results are based on the execution of a set of application programs on ...

1994

Causal distributed breakpoints

Willy Zwaenepoel

The authors define a causal distributed breakpoint, which is initiated by a sequential breakpoint in one process of a distributed computation and restores each process in the computation to its earliest state that reflects all events that happened before t ...

1990