CaltechAUTHORS
  A Caltech Library Service

Multi-Cluster interleaving in linear arrays and rings

Bruck, Jehoshua and Jiang, Anxiao (Andrew) (2003) Multi-Cluster interleaving in linear arrays and rings. California Institute of Technology . (Unpublished) http://resolver.caltech.edu:/CaltechPARADISE:2003.ETR051

[img]
Preview
PDF
See Usage Policy.

152Kb
[img]
Preview
Postscript
See Usage Policy.

941Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu:/CaltechPARADISE:2003.ETR051

Abstract

Interleaving codewords is an important method not only for combatting burst-errors, but also for flexible data-retrieving. This paper defines the Multi-Cluster Interleaving (MCI) problem, an interleaving problem for parallel data-retrieving. The MCI problems on linear arrays and rings are studied. The following problem is completely solved: how to interleave integers on a linear array or ring such that any m (m greater than or equal to 2) non-overlapping segments of length 2 in the array or ring have at least 3 distinct integers. We then present a scheme using a 'hierarchical-chain structure' to solve the following more general problem for linear arrays: how to interleave integers on a linear array such that any m (m greater than or equal to 2) non-overlapping segments of length L (L greater than or equal to 2) in the array have at least L + 1 distinct integers. It is shown that the scheme using the 'hierarchical-chain structure' solves the second interleaving problem for arrays that are asymptotically as long as the longest array on which an MCI exists, and clearly, for shorter arrays as well.


Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
http://www.paradise.caltech.edu/papers/etr051.pdfPublisherUNSPECIFIED
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2003.ETR051
Persistent URL:http://resolver.caltech.edu:/CaltechPARADISE:2003.ETR051
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26081
Collection:CaltechPARADISE
Deposited By: Imported from CaltechPARADISE
Deposited On:09 Apr 2003
Last Modified:26 Dec 2012 13:53

Repository Staff Only: item control page