Visual Data Rectangular Memory

Georgi Kuzmanov*, Georgi Gaydadjiev, Stamatis Vassiliadis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

We focus on the parallel access of randomly aligned rectangular blocks of visual data. As an alternative of traditional linearly addressable memories, we suggest a memory organization based on an array of memory modules. A highly scalable data alignment scheme incorporating module assignment functions and a new generic addressing function are proposed. To enable short critical paths and to save hardware resources, the addressing function implicitly embeds the module assignment functions and it is separable. A corresponding design is evaluated and compared to existing schemes and is found to be cost-effective I.

Original languageEnglish
Title of host publicationEuro-Par 2004 Parallel Processing
EditorsMarco Danelutto, Marco Vanneschi, Domenico Laforenza
PublisherSpringer
Pages760-767
Number of pages8
ISBN (Electronic)978-3-540-27866-5
ISBN (Print)978-3-540-22924-7
Publication statusPublished - 2004
Externally publishedYes
Event10th International Euro-Par Conference on Parallel Processing - Pisa, Italy
Duration: 1-Jan-2004 → …

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3149
ISSN (Print)0302-9743

Conference

Conference10th International Euro-Par Conference on Parallel Processing
Country/TerritoryItaly
CityPisa
Period01/01/2004 → …

Keywords

  • ACCESS

Cite this