Publication

Quantifying the Performance Differences Between PVM and TreadMarks

Related publications (131)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Getting in touch with text: Designing a mobile phone application for illiterate users to harness SMS

Jeffrey Huang, Hendrik Ole Knoche, Elsa Friscira

A large number of illiterate people - 800 million worldwide - are currently excluded from the benefits of asynchronous and cheap communication through text messages also known as SMS. Smart phones with touch screen will soon be in financial reach of illite ...

2012

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

Embarrassingly Scalable Database Systems

Anastasia Ailamaki

From Wikipedia-An embarrassingly parallel workload (or embarrassingly parallel problem) is one for which little or no effort is required to separate the problem into a number of parallel tasks. This is often the case where there exists no dependency (or co ...

2011

Orleans: Cloud Computing for Everyone

James Richard Larus

Cloud computing is a new computing paradigm, combining diverse client devices -- PCs, smartphones, sensors, single-function, and embedded -- with computation and data storage in the cloud. As with every advance in computing, programming is a fundamental ch ...

ACM2011

Efficiently Maintaining Distributed Model-Based Views on Real-Time Data Streams

Karl Aberer, Sebastian Michel, Ho Young Jeung, Petre Alexandru Arion

Minimizing communication cost is a fundamental problem in large-scale federated sensor networks. Existing solutions applicable for the problem are often ad-hoc for specific query types, or they are inefficient when query results contain large volumes of da ...

2011

QoS-ocMPI: QoS-aware on-chip Message Passing Library for NoC-based Many-Core MPSoCs

Giovanni De Micheli, Federico Angiolini, Jaime Joven Murillo

Homogeneous and heterogeneous NoC-based manycore MPSoCs are becoming widespread in many application areas. The diversity and spare network traffic characteristics generated by the IPs makes mandatory to provide certain Quality of Service (QoS) support for ...

2010

A Generic Parallel Collection Framework

Martin Odersky, Tiark Rompf, Aleksandar Prokopec

Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data structures come with a range of predefined operations which include sorting, ...

2010

PaxosInside

Rachid Guerraoui, Maysam Yabandeh

Amodernmanycore architecture can be viewed as a distributed system with explicit message passing to communicate between cores. Ensuring the consistency of shared state replicated over several cores is the key to the well functioning of such a system. Yet, ...

2010

JErlang: Erlang with Joins

Hubert Plociniczak

ERLANG is an industrially successful functional language that uses the Actor model for concurrency. It supports the message-passing paradigm by providing pattern-matching over received messages. Unfortunately coding synchronisation between multiple process ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Fast Access to Distributed Atomic Memory

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study eﬃcient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as a number of servers implementing the data structure. We determine the ...

Society for Industrial and Applied Mathematics2010