NDLI: A dynamic storage scheme for conflict-free vector access

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

Evaluating the performance of four snooping cache coherency protocols

Multi-level shared caching techniques for scalability in VMP-M/C

Design and performance of a coherent cache for parallel logic programming architectures

The Epsilon dataflow processor

An architecture of a dataflow single chip processor

Exploiting data parallelism in signal processing on a dataflow machine

Architectural mechanisms to support sparse vector processing

A dynamic storage scheme for conflict-free vector access

SIMP (Single Instruction stream/Multiple instruction Pipelining): a novel high-speed single-processor architecture

2-D SIMD algorithms in the perfect shuffle networks

Systematic hardware adaptation of systolic algorithms

Task migration in hypercube multiprocessors

Characteristics of performance-optimal multi-level cache hierarchies

Supporting reference and dirty bits in SPUR's virtual address cache

Inexpensive implementations of set-associativity

Organization and performance of a two-level virtual-real cache hierarchy

High performance communications in processor networks

Introducing memory into the switch elements of multiprocessor interconnection networks

Using feedback to control tree saturation in multistage interconnection networks

Constructing replicated systems using processors with point-to-point communication links

KCM: a knowledge crunching machine

A high performance Prolog processor with multiple function units

Evaluation of memory system for integrated Prolog processor IPP

A type driven hardware engine for Prolog clause retrieval over a large knowledge base

Comparing software and hardware schemes for reducing the cost of branches

Improving performance of small on-chip instruction caches

Achieving high instruction cache performance with an optimizing compiler

The impact of code density on instruction cache performance

Can dataflow subsume von Neumann computing?

Exploring the benefits of multiple hardware contexts in a multiprocessor architecture: preliminary results

Architectural and organizational tradeoffs in the design of the MultiTitan CPU

Run-time checking in Lisp by integrating memory addressing and range checking

Multiple vs. wide shared bus multiprocessors

Performance measurements on a commercial multiprocessor running parallel code

Interprocessor communication speed and performance in distributed-memory parallel processors

Analysis of computation-communication issues in dynamic dataflow architectures

Logic simulation on massively parallel architectures

R256: a research parallel processor for scientific computation

A three-port/three-access register file for concurrent processing and I/O communication in a RISC-like graphics engine

An architecture framework for application-specific and scalable architectures

Perfect Latin squares and parallel array access

An aperiodic storage scheme to reduce memory conflicts in vector processors

Analysis of vector access performance on skewed interleaved memory

Adaptive backoff synchronization techniques

A cache consistency protocol for multiprocessors with multistage networks

On data synchronization for multiprocessors

A dynamic storage scheme for conflict-free vector access

Content Provider	ACM Digital Library
Author	Harper, D. T. Linebarger, D. A.
Abstract	Previous investigations into data storage schemes have focused on finding a storage scheme that permits conflict-free access for a set of frequently encountered access patterns. This paper considers an alternative approach. Rather than forcing a single storage scheme to be used for all access patterns, conflict-free accesses of any constant stride can be made by selecting a storage scheme for each vector based on the accessing patterns used with that vector.By factoring the stride into two components, one a power of 2 and the other relatively prime to 2, a storage scheme can be synthesized which allows conflict-free access to the vector using the specified stride. All such schemes are based on a variation of the row rotation mechanism proposed by Budnik and Kuck[1]. Each storage scheme is based on two parameters, one describes the type of rotation to perform and the other describes the amount of memory to be rotated as a single block. Hardware required to implement this storage scheme is efficient.The performance of the memory under access strides other than the stride used to specify the storage scheme is also considered. This models a vector being accessed with multiple strides, in particular the row/column access of a matrix, and situations when the stride can not be determined prior to initializing the vector. Simulation results show that if a single buffer is added to each memory port then the average performance of the dynamic scheme surpasses that of the interleaved scheme for arbitrary stride accesses.For dynamic storage schemes to be effective, the compiler must be able to detect information about the stride of vector accesses. In general, this is within the capabilities of current vectorizing compilers. Dynamic storage schemes also may allow more flexibility in program transformation performed by vectorizing compilers during optimization.
Starting Page	72
Ending Page	77
Page Count	6
File Format	PDF
ISBN	0897913191
DOI	10.1145/74925.74934
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-04-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