Publications related to Isolates, channels, and event streams for composable distributed programming

Fabrication of polymer-based micro devices: formulation and study of the paste

Peter Ryser, Thomas Maeder, Nathalie Sophie Adeline Serra, Olivier Gentsch

We investigate in the present work the fabrication of polymer-based micro-fluidic and micro-mechanical devices using sacrificial, resistive/conductive pastes, through a screen-printing process. An organic sacrificial paste is first screen-printed onto a su ...

Elsevier Science, Reg Sales Off, Customer Support Dept, 655 Ave Of The Americas, New York, Ny 10010 Usa2010

Fabrication of Polymer-Based Micro Devices: Formulation and Study of the Paste

Peter Ryser, Thomas Maeder, Nathalie Sophie Adeline Serra, Olivier Gentsch

We investigate in the present work the fabrication of polymer-based micro-fluidic and micro-mechanical devices using sacrificial, resistive/conductive pastes, through a screen-printing process. An organic sacrificial paste is first screen-printed onto a su ...

Elsevier Science, Reg Sales Off, Customer Support Dept, 655 Ave Of The Americas, New York, Ny 10010 Usa2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an in- creasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural ex- tension of the random phone-call ...

Springer2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call mode ...

2010

State Exploration of Scala Actor Programs

Mirco Dotta

The growing use of multicore and networked computing systems is increasing the importance of developing reliable parallel and distributed code. Unfortunately, developing and testing such code is notoriously hard, especially for shared-memory models of prog ...

2009

A Class of Transformations that Polarize Binary-Input Memory less Channels

Satish Babu Korada, Eren Sasoglu

A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest

p

-correlation while ...

2008

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating ...

2008

Implementing Joins using Extensible Pattern Matching

Philipp Haller

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementati ...

Springer2008

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

Isolates, channels, and event streams for composable distributed programming

Graph Chatbot

Chat with Graph Search

Fabrication of polymer-based micro devices: formulation and study of the paste

Fabrication of Polymer-Based Micro Devices: Formulation and Study of the Paste

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

State Exploration of Scala Actor Programs

A Class of Transformations that Polarize Binary-Input Memory less Channels

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

Implementing Joins using Extensible Pattern Matching

The Perfectly-Synchronized Round-based Model of Distributed Computing

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

State Exploration of Scala Actor Programs

Fabrication of Polymer-Based Micro Devices: Formulation and Study of the Paste

Fabrication of polymer-based micro devices: formulation and study of the paste

The Perfectly-Synchronized Round-based Model of Distributed Computing

Implementing Joins using Extensible Pattern Matching

A Class of Transformations that Polarize Binary-Input Memory less Channels

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete