Results 1 - 10 of 1,253

CC++: A Declarative Concurrent Object Oriented Programming Notation

by K. Mani Chandy, Carl Kesselman , 1992
"... CC++ is Compositional C++ , a parallel object-oriented notation that consists of C++ with six extensions. The goals of the CC++ project are to provide a theory, notation and tools for developing reliable scalable concurrent program libraries, and to provide a framework for unifying: 1. distributed r ..."
Abstract - Cited by 69 (8 self) - Add to MetaCart
CC++ is Compositional C++ , a parallel object-oriented notation that consists of C++ with six extensions. The goals of the CC++ project are to provide a theory, notation and tools for developing reliable scalable concurrent program libraries, and to provide a framework for unifying: 1. distributed

C.2.4 [Computer-communication networks]: Distributed

by Nuno Preguiça, Carlos Baquero, Paulo Sérgio Almeida, Victor Fonte, Ricardo Gonçalves
"... Version vectors (VV) are used pervasively to track dependencies between replica versions in multi-version distributed storage systems. In these systems, VV tend to have a dual functionality: identify a version and encode causal dependencies. In this paper, we show that by maintaining the identifier ..."
Abstract - Add to MetaCart
Version vectors (VV) are used pervasively to track dependencies between replica versions in multi-version distributed storage systems. In these systems, VV tend to have a dual functionality: identify a version and encode causal dependencies. In this paper, we show that by maintaining the identifier

Increasing the Concurrency in Estelle

by J. Bredereke, R. Gotzhein - Formal Description Techniques, VI". North-Holland , 1994
"... In general, the potential parallelism expressed in a specification should be as high as possible in order to allow for most efficient implementations. We argue that there are currently important limitations of expressing concurrency in Estelle. Therefore, we propose a minor, fully compatible extensi ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
In general, the potential parallelism expressed in a specification should be as high as possible in order to allow for most efficient implementations. We argue that there are currently important limitations of expressing concurrency in Estelle. Therefore, we propose a minor, fully compatible

Verifying concurrent message-passing C programs with recursive calls.

by S Chaki , E Clarke , N Kidd , T Reps , T Touili , 2005
"... Abstract. We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce ..."
Abstract - Cited by 41 (16 self) - Add to MetaCart
Abstract. We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce

D 2 C: A Deterministic, Deadlock-free Concurrent Programming Model

by Nalini Vasudevan
"... Abstract—The advent of multicore processors has made concurrent programming models mandatory. However, most concurrent programming models come with a repertoire of problems. The two major ones are non-determinism and deadlocks. By determinism, we mean the output behavior of the program is independen ..."
Abstract - Add to MetaCart
deadlocks. In this paper, we propose D 2 C, a new programming model that guarantees the two desirable properties of concurrency- determinism and deadlock-freedom. Any program in this model will be deterministic; the output of the program will solely depend on the input and not on the interleaving

Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts

by Philip Klein, Serge Plotkin, Clifford Stein, Iva Tardos - SIAM Journal on Computing , 1994
"... Abstract. This paper describes new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. These algorithms are much faster than algorithms discovered previously. Besides being an important problem in its own right, the uniform-capacity concurrent flo ..."
Abstract - Cited by 88 (20 self) - Add to MetaCart
used uniform-capacity concurrent flow to solve approximately a channel width minimization problem in very large scale integration. An O (k 3/2 (m + n log n)) expected-time randomized algorithm and an O (k min {n, k} (m + n log n) log k) deterministic algorithm is given for this problem when the channel

Abstract Verifying Concurrent Message-Passing

by Sagar Chaki Edmund Clarke, C Programs, Recursive Calls
"... We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachab ..."
Abstract - Add to MetaCart
We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce

Quickly Generating Billion-Record Synthetic Databases

by Jim Gray, Prakash Sundaresan, Susanne Englert, Peter J. Weinberger , 1994
"... : Evaluating database system performance often requires generating synthetic databases -- ones having certain statistical properties but filled with dummy information. When evaluating different database designs, it is often necessary to generate several databases and evaluate each design. As databas ..."
Abstract - Cited by 113 (1 self) - Add to MetaCart
-case discrete logarithms to generate indices concurrent to the base table generation. (4) Modification of (2) to get exponential, normal, and self-similar distributions. The discussion is in terms of generating billion-record SQL databases using C programs running on a shared-nothing computer system consisting

Self-Synchronization of Concurrent Processes

by Lalita Jategaonkar, Lalita Jategaonkar, Albert R. Meyer, Albert R. Meyer , 1993
"... We introduce a unary "self-synchronization" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self-synchronization and unsync ..."
Abstract - Add to MetaCart
We introduce a unary "self-synchronization" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self

Concurrent stimulation of cannabinoid CB1 and dopamine D2 receptors augments cAMP accumulation in striatal neurons: Evidence for a Gs linkage to the CB1 receptor. J Neurosci 17:5327–5333

by Michelle Glass, Christian C. Felder , 1997
"... Cannabinoids act at the CB1 receptor to inhibit adenylate cyclase activity via a pertussis toxin-sensitive G-protein. Within the striatum, CB1 receptors have been shown to be localized on the same neurons as G i-coupled dopamine D2 receptors. In this study we have examined the interactions of CB1 an ..."
Abstract - Cited by 55 (3 self) - Add to MetaCart
, HU210 and quinpirole in combination augmented cAMP accumulation. This augmentation was blocked by the CB1 receptor antagonist SR141716A or the D2 antagonist sulpride. Pertussis toxin treatment of striatal neurons prevented the inhibition of cAMP accumulation by D2 receptors but unmasked a cannabinoid
Results 1 - 10 of 1,253