Sciweavers

4213 search results - page 180 / 843
» The Tau Parallel Performance System
Sort
View
CONCUR
1999
Springer
15 years 8 months ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer
ICPADS
1997
IEEE
15 years 8 months ago
Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications
The paper presents eficient scalable algorithms for performing Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory ( D S M ) system with applications....
V. Kamakoti, N. Balakrishnan
APPINF
2003
15 years 5 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...
DAC
2008
ACM
15 years 6 months ago
Analog parallelism in ring-based VCOs
The performance advantages in parallel ring-based VCOs are explored. When the number of VCOs is doubled, the parallel VCOs enhance phase noise by 3dB, and the within-chip process-...
Daeik D. Kim, Choongyeun Cho, Jonghae Kim
ICPP
2009
IEEE
15 years 11 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu