Results 1 - 10 of 382

Petrify: a tool for manipulating concurrent specifications and . . .

by Jordi Cortadella, et al.
"... Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original descripti ..."
Abstract - Cited by 219 (34 self) - Add to MetaCart
Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original

Stochastic automata network for modeling parallel systems

by Brigitte Plateau, Karim Atif - IEEE Trans. Software Eng , 1991
"... Abstract-This paper is motivated by the study of the per-formance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of state-transition graphs. The state spac ..."
Abstract - Cited by 128 (10 self) - Add to MetaCart
Abstract-This paper is motivated by the study of the per-formance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of state-transition graphs. The state

Efficient Performance Analysis of Asynchronous Systems Based on Periodicity

by E. G. Coffman
"... This paper presents an efficient method for the performance analysis and optimization of asynchronous systems. An asynchronous system is modeled as a marked graph with probabilistic delay distributions. We show that these systems exhibit inherent periodic behaviors. Based on this property, we derive ..."
Abstract - Add to MetaCart
This paper presents an efficient method for the performance analysis and optimization of asynchronous systems. An asynchronous system is modeled as a marked graph with probabilistic delay distributions. We show that these systems exhibit inherent periodic behaviors. Based on this property, we

Efcient Performance Analysis of Asynchronous Systems Based on Periodicity

by E. G. Coffman
"... This paper presents an efcient method for the performance anal-ysis and optimization of asynchronous systems. An asynchronous system is modeled as a marked graph with probabilistic delay dis-tributions. We show that these systems exhibit inherent periodic behaviors. Based on this property, we derive ..."
Abstract - Add to MetaCart
This paper presents an efcient method for the performance anal-ysis and optimization of asynchronous systems. An asynchronous system is modeled as a marked graph with probabilistic delay dis-tributions. We show that these systems exhibit inherent periodic behaviors. Based on this property, we

Algorithms for Synthesis of Hazard-Free Asynchronous Circuits

by L. Lavagno, K. Keutzer, A. Sangiovanni-vincentelli - IEEE Transactions on Computer-Aided Design , 1991
"... A technique for the synthesis of asynchronous sequential circuits from a Signal Transition Graph (STG) specification is described. We give algorithms for synthesis and hazard removal, able to produce hazard-free circuits with the bounded wire-delay model, requiring the STG to be live, safe and to ha ..."
Abstract - Cited by 78 (4 self) - Add to MetaCart
systems, where "lazy evaluation" style designs may extend the average life of a battery, are two examples. In addition, clock skew problems limit the performance and the flexibility of large scale synchronous systems. On the other hand asynchronous design is harder and more constrained than

Asynchronous Group Mutual Exclusion

by Yuh-Jzer Joung - Distributed Computing , 1998
"... Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on dierent groups of processes in accessing a reso ..."
Abstract - Cited by 37 (1 self) - Add to MetaCart
also propose several criteria to evaluate solutions of the problem and to measure their performance. Finally, we provide an ecient and highly concurrent distributed algorithm for the problem in a sharedmemory model where processes communicate by reading from and writing to shared variables

Performance analysis of concurrent systems with early evaluation

by Jorge Júlvez - In Proceedings International Conference on Computer-Aided Design , 2006
"... Early evaluation allows to execute operations when enough information at the inputs has been received to determine the value at the outputs. Systems that can tolerate variable-latency units, such as latency-insensitive or asynchronous systems, can enhance their performance by using early evaluation. ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
Early evaluation allows to execute operations when enough information at the inputs has been received to determine the value at the outputs. Systems that can tolerate variable-latency units, such as latency-insensitive or asynchronous systems, can enhance their performance by using early evaluation

Performance Evaluation of Concurrent Collections on High-Performance Multicore Computing Systems

by Aparna Ch, Kathleen Knobe, Richard Vuduc
"... This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her computation in terms of application-specific operations, partially-ordered by semantic scheduling constraints. The CnC mode ..."
Abstract - Cited by 14 (2 self) - Add to MetaCart
C model is well-suited to expressing asynchronous-parallel algorithms, so we evaluate CnC using two dense linear algebra algorithms in this style for execution on state-of-the-art multicore systems: (i) a recently proposed asynchronous-parallel Cholesky factorization algorithm, (ii) a novel and non

BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems

by Tevfik Bultan - In Proc. TACAS 2000, LNCS 1785 , 2000
"... BDD-based symbolic model checking has been successful in verification of a wide range of systems. Recently, constraint-based approaches, which use arithmetic constraints as a symbolic representation, have been used in symbolic model checking of infinite-state systems. We argue that use of constraint ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
compare the performance of BDD-based model checker SMV to the performance of our constraintbased model checker on verification of several asynchronous concurrent systems. The results indicate that constraint-based model checking is a viable option for verification of asynchronous concurrent systems

Performance Analysis and Optimization of Mixed Asynchronous Synchronous Systems

by J. Teich, L. Thiele, S. Sriram, M. Martin , 1997
"... This paper deals with the system-level performance analysis and optimization of a class of digital systems we call mixed asynchronous-synchronous systems. In such a system, each computation module is either synchronous or asynchronous. The communication between all the modules is assumed to be data ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
This paper deals with the system-level performance analysis and optimization of a class of digital systems we call mixed asynchronous-synchronous systems. In such a system, each computation module is either synchronous or asynchronous. The communication between all the modules is assumed
Results 1 - 10 of 382