Sciweavers

238 search results - page 11 / 48
» A Collection Operator for Graph Transformation
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Main Concepts of Networks of Transformation Units with Interlinking Semantics
The aim of this paper is to introduce a modelling concept and structuring principle for rule-based systems the semantics of which is not restricted to a sequential behavior, but ca...
Dirk Janssens, Hans-Jörg Kreowski, Grzegorz R...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
EUROPAR
2009
Springer
14 years 2 months ago
Process Mapping for MPI Collective Communications
It is an important problem to map virtual parallel processes to physical processors (or cores) in an optimized way to get scalable performance due to non-uniform communication cost...
Jin Zhang, Jidong Zhai, Wenguang Chen, Weimin Zhen...
SC
2005
ACM
14 years 1 months ago
Transformations to Parallel Codes for Communication-Computation Overlap
This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI’s collective operations. Our transforma...
Anthony Danalis, Ki-Yong Kim, Lori L. Pollock, D. ...
WADT
1998
Springer
13 years 11 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...