## Search

Now showing items 1-10 of 219

#### Supporting increment and decrement operations in balancing networks

(1999)

Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, ...

#### Efficiency of semisynchronous versus asynchronous networks

(1994)

The s-session problem is studied in asynchronous and semisynchronous networks. Processes are located at the nodes of an undirected graph G and communicate by sending messages along links that correspond to the edges of G. ...

#### Implementing interaction nets in MONSTR

(Association for Computing Machinery, 1997)

Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from multiplicative Linear Logic and feature undirected graph edges, while MONSTR arose from the desire ...

#### Term graph rewriting as a specification and implementation framework for concurrent object-oriented programming languages

(IEEE, 1995)

The usefulness of the generalized computational model of Term Graph Rewriting Systems (TGRS) for designing and implementing concurrent object-oriented languages, and also for specifying and reasoning about the interaction ...

#### Linear behaviour of term graph rewriting programs

(ACM, 1995)

The generalized term graph rewriting computational model is exploited to implement concurrent languages based on Girard's Linear Logic (LL). In particular a fragment of LL is identified which is able to serve as a `process ...

#### Highly parallel model for object-oriented concurrent constraint programming

(IEEE, 1995)

Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting ...

#### Extracting parallelism in Fortran by translation to a single assignment intermediate form

(Publ by IEEE, 1994)

This paper presents MUSTANG, a system for translating Fortran to single assignment form in an effort to automatically extract parallelism. Specifically, a sequential Fortran source program is translated into IF1, a ...

#### Efficient counting network

(1998)

Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance ...

#### Impossibility results for weak threshold networks

(1997)

It is shown that a weak threshold network (in particular, threshold network) of width w and depth d cannot be constructed from balancers of width p0, p1, . . . , pm-1, if w does not divide Pd, where P is the least common ...

#### Role of Temporal Integration and Fluctuation Detection in the Highly Irregular Firing of a Leaky Integrator Neuron Model with Partial Reset

(1997)

Partial reset is a simple and powerful tool for controlling the irregularity of spike trains fired by a leaky integrator neuron model with random inputs. In particular, a single neuron model with a realistic membrane time ...