schliessen

Filtern

 

Bibliotheken

2.

Automatic intra-register vectorization for the Intel[R] architecture
by Bik, Aart J.C

International journal of parallel programming, 2002, Vol.30 (2), p.65-98

3.

Generation of efficient nested loops from polyhedra
by Quillere, Fabien

International journal of parallel programming, 2000, Vol.28 (5), p.469-498

5.

A vectorizing compiler for multimedia extensions
by Sreraman, N

International journal of parallel programming, 2000, Vol.28 (4), p.363-400

6.

Compilation techniques for multimedia processors
by Krall, Andreas

International journal of parallel programming, 2000, Vol.28 (4), p.347-361

8.

Achieving scalable locality with time skewing
by Wonnacott, David

International journal of parallel programming, 2002, Vol.30 (3), p.181-221

9.

Dataflow analysis of array and scalar references
by FEAUTRIER, P

International journal of parallel programming, 1991, Vol.20 (1), p.23-53

10.

Hopeful recipe
by Campbell, John A

Nature (London), 1990, Vol.347 (6293), p.593-594

11.

Optimized unrolling of nested loops
by Sarkar, Vivek

International journal of parallel programming, 2001, Vol.29 (5), p.545-581

12.

Modeling Multithreaded Applications using Petri nets
by Kavi, Krishna M

International journal of parallel programming, 2002, Vol.30 (5), p.353-371

14.

Index Set Splitting
by Griebl, Martin

International journal of parallel programming, 2000, Vol.28 (6), p.607-631

15.

The design of the PROMIS compiler -- towards multi-level parallelism
by Saito, Hideki

International journal of parallel programming, 2000, Vol.28 (2), p.195

16.

Fast greedy weighted fusion
by Kennedy, Ken

International journal of parallel programming, 2001, Vol.29 (5), p.463-491

18.

Iterative modulo scheduling
by RAMAKRISHNA RAU, B

International journal of parallel programming, 1996, Vol.24 (1), p.3-64

20.

Parameterized polyhedra and their vertices
by LOECHNER, V

International journal of parallel programming, 1997, Vol.25 (6), p.525-549

Recommended databases

Find more Articles matching your search terms in these recommended databases.