Publication:4855368

zbMath0851.68014MaRDI QIDQ4855368

No author found.

Publication date: 9 November 1995

zbMATH Keywords

vector machines; generating optimized parallel code; message-passing machines; multiprocessors with shared memory; scalable shared-memory machines

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68N15: Theory of programming languages

68N20: Theory of compilers and interpreters

Related Items

Implementation and evaluation of HPF/SX V2, Partial redundancy elimination for access path expressions, Locality optimization in JavaParty by means of static type analysis, PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters, Revisiting communication code generation algorithms for message-passing systems, Interprocedural Induction Variable Analysis, Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP, A hardware independent parallel programming model, Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies, Reducing off-chip memory access via stream-conscious tiling on multimedia applications, Simple section interchange and properties of non-computable functions, Eliminating partially dead code in explicitly parallel programs, An adaptive multigrid technique for evaluating long-range forces in biomolecular simulations, SAC -- a functional array language for efficient multi-threaded execution, Canonical scattered context generators of sentences with their parses, A polynomial-time algorithm for memory space reduction, Solutions to four open problems concerning controlled pure grammar systems, Parallelization of Recurrent Loops Due to the Preliminary Computation of Superpositions, Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL