NDLI: Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications

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

Compiler techniques for high performance sequentially consistent java programs

Composable memory transactions

Automated type-based analysis of data races and atomicity

Language innovations for HPCS

A novel approach for partitioning iteration spaces with variable densities

Using multiple energy gears in MPI programs on a power-scalable cluster

Trust but verify: monitoring remotely executing programs for progress and correctness

Teleport messaging for distributed stream programs

A sampling-based framework for parallel data mining

Why is graphics hardware so fast?

Effective communication coalescing for data-parallel applications

Static analysis of atomicity for programs with non-blocking synchronization

Modeling wildcard-free MPI programs for verification

Automatic multithreading and multiprocessing of C programs for IXP

Exposing disk layout to compiler for reducing energy consumption of parallel disk based systems

Applications of synchronization coverage

Adaptive execution techniques for SMT multiprocessor architectures

Performance modeling and optimization of parallel out-of-core tensor contractions

A linear-time algorithm for optimal barrier placement

Revocable locks for non-blocking programming

Scaling model checking of dataraces using dynamic information

Exposing speculative thread parallelism in SPEC2000

Energy conservation in heterogeneous server clusters

Fault tolerant high performance computing by a coding approach

System-wide performance monitors and their application to the optimization of coherent memory accesses

A framework for adaptive algorithm selection in STAPL

An evaluation of global address space languages: co-array fortran and unified parallel C

Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications

Locality aware dynamic load management for massively multiplayer games

Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications

Content Provider	ACM Digital Library
Author	Low, Tze Meng van de Geijn, Robert A. Van Zee, Field G.
Abstract	We show how to exploit high-level information, available as part of the derivation of provably correct algorithms, so that SMP parallelism can be systematically identified. Recent research has shown that loop-based dense linear algebra algorithms can be systematically derived from the mathematical specification of the operation. Fundamental to the methodology is the determination of loop-invariants (in the sense of Dijkstra and Hoare) from which correct loops can be systematically derived. We show how the high-level specification of the operation together with these loop-invariants can be exploited to detect the independence of loop iterations. This in turn then allows a Workqueuing Model to be used to implement and parallelize the algorithms using a feature proposed for OpenMP 3.0, task queues. Although performance is not the main feature of this paper, performance is reported on a 4 CPU Itanium2 server for a concrete example, the symmetric rank-k update operation.
Starting Page	153
Ending Page	163
Page Count	11
File Format	PDF
ISBN	1595930809
DOI	10.1145/1065944.1065965
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-06-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Code generation Smp parallelism Linear algebra Formal derivation
Content Type	Text
Resource Type	Article

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

The science of deriving dense linear algebra algorithms

Under consideration for publication in formal aspects of computing deriving dense linear algebra libraries.

Formal Correctness and Stability of Dense Linear Algebra Algorithms Abstract- The Formal Linear Algebra Methods Environment

Extracting SMP Parallelism . . . (2005)

A Framework for Sparse Matrix Code Synthesis from High-level Specifications

Formal Derivation of Algorithms: The Triangular Sylvester Equation (2001)

Generating optimized code from SCR specifications

Mechanizing the expert dense linear algebra developer

High performance dense linear algebra on a spatially distributed processor

Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications

Similar Documents

The science of deriving dense linear algebra algorithms

Under consideration for publication in formal aspects of computing deriving dense linear algebra libraries.

Formal Correctness and Stability of Dense Linear Algebra Algorithms Abstract- The Formal Linear Algebra Methods Environment

Extracting SMP Parallelism . . . (2005)

A Framework for Sparse Matrix Code Synthesis from High-level Specifications

Formal Derivation of Algorithms: The Triangular Sylvester Equation (2001)

Generating optimized code from SCR specifications

Mechanizing the expert dense linear algebra developer

High performance dense linear algebra on a spatially distributed processor

Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications