Conflict-free access to templates of trees and hypercubes in parallel memory systems

1997 ◽  
pp. 1-10 ◽  
Author(s):  
Sajal K. Das ◽  
M. Cristina Pinotti
Keyword(s):  
Memory Systems ◽  
Free Access ◽  
Parallel Memory

Are attachment working models represented in three parallel memory systems?

2005 ◽  
Author(s):  
Maya Sakellaropoulo ◽  
Mark Baldwin ◽  
Norman White
Keyword(s):  
Memory Systems ◽  
Parallel Memory ◽  
Working Models

Multiple Templates Access of Trees in Parallel Memory Systems

1998 ◽  
Vol 49 (1) ◽  
pp. 22-39 ◽  
Author(s):  
Vincenzo Auletta ◽  
Amelia De Vivo ◽  
Vittorio Scarano
Keyword(s):  
Memory Systems ◽  
Parallel Memory ◽  
Multiple Templates

Multiple Parallel Memory Systems in the Brain of the Rat

2002 ◽  
Vol 77 (2) ◽  
pp. 125-184 ◽  
Author(s):  
Norman M. White ◽  
Robert J. McDonald
Keyword(s):  
Memory Systems ◽  
Parallel Memory ◽  
The Brain

Block, multistride vector, and FFT accesses in parallel memory systems

1991 ◽  
Vol 2 (1) ◽  
pp. 43-51 ◽  
Author(s):  
D.T. Harper
Keyword(s):  
Memory Systems ◽  
Parallel Memory

scholarly journals An Efficient Parallel Algorithm for Latin Square Design: A Multi Core CPU Approach

2017 ◽  
Vol 2 (2) ◽  
pp. 27
Author(s):  
Abhay B. Rathod ◽  
Sanjay M. Gulhane
Keyword(s):  
Parallel Algorithm ◽  
Design Theory ◽  
Interconnection Network ◽  
Latin Square ◽  
Data Access ◽  
Latin Squares ◽  
Sequential Algorithm ◽  
Free Access ◽  
Parallel Memory ◽  
Free Data

Abstract— The theory of Latin squares is very important tool in design theory. Like much of design theory, Latin squares have various applications in statistics, finite geometries and experimental design, to name a few. In this paper, we proposed an efficient parallel algorithm for Latin square design which have desirable properties for parallel array access. These squares provide conflict free access to various subsets of an n x n array using n memory modules. A transversal of such a square is a set of n entries such that no two entries share the same row, column or symbol. We present a general construction method for building parallel Latin square of order n2 for all n. The proposed algorithm presents a quick parallel method to produce a Latin square design and a parallel conflict access of data in SIMD system. The simulation results of the proposed parallel algorithm for Latin square design were compared with the traditional sequential algorithm Latin square design in terms of speedup and efficiency. The results of parallel Latin Square design were very promising and showed a potential that this design could successfully be applied to the parallel routing problems for conflict free data access. At last, the results show that the parallel versions of former sequential algorithm with simple modifications achieve the super linear speedup up to 200 times for matrix size of 256.   Index Terms: Latin square, multi core processor, parallel processing, simulation, parallel memory system, skewing scheme, multistage interconnection network.

Sign in / Sign up

Export Citation Format

Share Document