NDLI: GTS: parallelization and vectorization of tight recurrences

Please wait, while we are loading the content...

QCD with dynamical fermions on the connection machine

Vectorization on Monte Carlo particle transport: an architectural study using the LANL benchmark “GAMTEB”

Parallelizing a large scientific code - methods, issues, and concerns

Benchmark calculations with an unstructured grid flow solver on a SIMD computer

Implementation of a hypersonic rarefied flow particle simulation on the connection machine

Computational aerothermodynamics

Practical parallel supercomputing: examples from chemistry and physics

Capability of current supercomputers for the computational fluid dynamics

Supercomputing of circuits simulation

Computations of soil temperature rise due to HVDC ground return

A radar simulation program for a 1024-processor hypercube

Parallel MIMD programming for global models of atmospheric flow

Computational fluid dynamic-current capabilities and directions for the future

Parallel algorithm and VLSI architecture for a robot's inverse kinematics

Supercomputers in computational ocean acoustics

A study of dissipation operators for the euler equations and a three- dimensional channel flow

A computer assisted optimal depth lower bound for sorting networks with nine inputs

Realities associated with parallel processing

How a SIMD machine can implement a complex cellular automata? a case study: von Neumann's 29-state cellular automaton

Automatic vectorization of character string manipulation and relational operations in Pascal

Neural network simulation on shared-memory vector multiprocessors

Concurrent and vectorized Monte Carlo simulation of the evolution of an assembly of particles increasing in number

Protein structure prediction by a data-level parallel algorithm

Vector and parallel algorithms for Cholesky factorization on IBM 3090

FFTs in external of hierarchical memory

Macrotasking the singluar value decomposition of block circulant matrices on the Cray-2

A block QR factorization algorithm using restricted pivoting

Tuning the rank-n update in a wavefront solver for peak performance

Load balancing and task decomposition techniques for parallel implementation of integrated vision systems algorithms

Efficient computation of the singular value decomposition on cube connected SIMD machine

Knowledge representation on the connection machine

Dilation d embedding of a hyper-pyramid into a hypercube

Parallel characteristics of sequence alignment algorithms

A new approach to processor allocation and task migration in an N-cube multiprocessor

Matrix multiplication on the connection machine

Parallel solution of pentadiagonal systems using generalized odd-even elimination

Element order and convergence rate of the conjugate gradient method for data parallel stress analysis

Parallel algorithms for geometric searching problems

A parallel algorithm for the quadratic assignment problem

Efficient circuit partitioning algorithms for parallel logic simulation

Communication reduction for distributed sparse matrix factorization on a processor mesh

Parallel algorithms for super performance

A dynamic scheduling strategy for the Chare-Kernel system

On the mapping problem for multi-level systems

High performance parallel architectures

Static synchronization beyond VLIW

The HCN: a versatile interconnection network based on cubes

Communication in iWarp systems

Optical digital computers

The $i860^{TM}$ 64-bit supercomputing microprocessor

Multiprocessor simulation of neural networks with NERV

$C^{2}MP:$ a cache-coherent, distributed memory multiprocessor-system

DASP: a general-purpose MIMD parallel computer using distributed associative processing

Combining produce and consume operations in a pipelined shared memory multiprocessor

QCDPAX-an MIMD array of vector processors for the numerical simulation of quantum chromodynamics

A high performance reconfigurable parallel processing architecture

Using PAGE-AHEAD for large FORTRAN programs

Building analytical models into an interactive performance prediction tool

GTS: parallelization and vectorization of tight recurrences

The parascope editor: an interactive parallel programming tool

Automatic data/program partitioning using the single assignment principle

The composition of concurrent programs

FUTURES: a mechanism for concurrency among objects

HDB-a high level debugging

File concepts for parallel I/O

Event synchronization analysis for debugging parallel programs

An environment for performance experiment on multiprocessors

Visualizing relativistic effects in spacetime

Refined Fortran: an update

Parallel language constructs for tensor product computations on loosely coupled architectures

Models for visualization in parallel debuggers

A methodology for parallelizing programs for multicomputers and complex memory multiprocessors

Visualization of supercomputer simulations in physics

More iteration space tiling

Parallel processor balance through loop spreading

A preceding activation scheme with graph unfolding for the parallel processing system-array

LIMITS-a system for UNIX resource administration

UNIX security in a supercomputing environment

Optimal selection theory for superconcurrency

Comparative performance of circuit-switched networks based on blocking probability

Multiple crossbar network integrated supercomputing framework

Effective use of Cray supercomputers

Type of service wide area networking

Construction of internet for Japanese academic communities

High performance file system for supercomputing environment

Computing performance as a function of the speed, quantity, and cost of the processors

K9: a simulator of distributed-memory parallel processors

Some results in memory conflict analysis

Vector performance analysis of three supercomputers: Cray 2, Cray Y-MP, and ETA 10-Q

Implementing parallel sorting algorithms on a linear array of transputers

Performance analysis of high-speed computers

A radix-2 FFT on connection machine

A comparison study of automatically vectorizing Fortran compilers

Memory conflicts and machine performance

Measuring the scalability of parallel computer systems

Hardware technology and architecture of the NEC SX-3/SX-X supercomputer system

GTS: parallelization and vectorization of tight recurrences

Content Provider	ACM Digital Library
Author	Torres, J. Ayguadé, E. Borensztejn, P. Labarta, J.
Abstract	In this paper we present a new method for extracting the maximum parallelism or vector operations out of DO loops with tight recurrences using sequential programming languages. We have named the method Graph Traverse Scheduling (GTS). It is devised to produce code for shared memory multiprocessors or vector machines. When parallelizing, hardware support for fast synchronization is assumed.The method is presented for single nested loops including one or several recurrences and we show how parallel and vector code is generated. Based on the dependence graph of a loop, we first evaluate its parallelism and vector length of statements. Then we apply GTS to distribute loop iterations between tasks or to generate vector operations of a given length. When this method is applied for parallel code generation, dependencies not included in the sequential execution of each task must be explicitly synchronized. A method to minimize the number of explicit synchronizations is also presented. We also present how to compute the synchronization-free parallelism obtaining fully independent tasks.When GTS is applied for vector code generation, a sequential loop of vector operations is obtained.
Starting Page	531
Ending Page	539
Page Count	9
File Format	PDF
ISBN	0897913418
DOI	10.1145/76263.76322
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-08-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in