1075 search results - page 55 / 215 » Parallel Programming with Transactional Memory |
138
click to vote
LCPC
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...
146
click to vote
ISCA
1993
IEEE
15 years 6 months ago
1993
IEEE
er uses an abstract machine approach to compare the mechanisms of two parallel machines: the J-Machine and the CM-5. High-level parallel programs are translated by a single optimi...
107
click to vote
EUROPAR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
122
click to vote
HPCA
1995
IEEE
15 years 6 months ago
1995
IEEE
Information on the behavior of programs is essential for deciding the number and nature of functional units in high performance architectures. In this paper, we present studies on...
ARC
2009
Springer
15 years 9 months ago
2009
Springer
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...