Sciweavers

5180 search results - page 292 / 1036
» Concurrency, Time, and Constraints
Sort
View
SAC
2010
ACM
15 years 12 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
EUROMICRO
2002
IEEE
15 years 11 months ago
Performance Tradeoffs for Static Allocation of Zero-Copy Buffers
Internet services like the world-wide web and multimedia applications like News- and Video-on-Demand have become very popular over the last years. Due to the large number of users ...
Pål Halvorsen, Espen Jorde, Karl-André...
FCCM
2000
IEEE
131views VLSI» more  FCCM 2000»
15 years 11 months ago
A Reliable LZ Data Compressor on Reconfigurable Coprocessors
Data compression techniques based on Lempel-Ziv (LZ) algorithm are widely used in a variety of applications, especially in data storage and communications. However, since the LZ a...
Wei-Je Huang, Nirmal R. Saxena, Edward J. McCluske...
CONCURRENCY
2010
110views more  CONCURRENCY 2010»
15 years 6 months ago
Redesigning the message logging model for high performance
Over the past decade the number of processors in the high performance facilities went up to hundreds of thousands. As a direct consequence, while the computational power follow th...
Aurelien Bouteiller, George Bosilca, Jack Dongarra
ENTCS
2007
126views more  ENTCS 2007»
15 years 6 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari