We describe Charm++, an object oriented portable parallel programming language based
on Cff. Its design philosophy, implementation, sample applications and their performance on …

The literature describes two high performance concurrent stack algorithms based on
combining funnels and elimination trees. Unfortunately, the funnels are linearizable but …

To program massively concurrent MIMD machines, programmers need tools for managing
complexity. One important tool that has been used in the sequential programming world is …

The literature describes two high performance concurrent stack algorithms based on
combining funnels and elimination trees. Unfortunately, the funnels are linearizable but …

Shared pools and stacks are two coordination structures with a history of applications
ranging from simple producer/consumer buffers to job-schedulers and procedure stacks …

Shared pools and stacks are two coordination structures with a history of applications
ranging from simple producer/consumer buffers to job-schedulers and procedure stacks …

Parallel computing and distributed computing have traditionally evolved as two separate
research disciplines. Parallel computing has addressed problems of communication …

Re-use of synchronization code in concurrent OO-languages has been considered difficult
due to i7lheriinrice anomaly, which we minimize with our new pre posal. Designed with hi …

This paper studies the invariance groups \bfS(f) of boolean functions f∈\bfB_n (ie,
f:{0,1\}^n→{0,1\}) on n variables, ie, the set of all permutations on n elements which leave f …

Bloom Blo79] argues that for a synchronisation mechanism to have good expressive power,
it must have access to six di erent types of information: the name of the invoked operation …