CONSTANT DELAY PARALLEL COUNTERS-Reference-Cited by-同舟云学术

CONSTANT DELAY PARALLEL COUNTERS

Published:1991-12 Issue:02 Volume:01 Page:143-148
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

AKL SELIM G.¹,DUBOUX THIBAULT²,STOJMENOVIC IVAN³

Affiliation:

1. Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada K7L 3N6, Canada

2. Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France

3. Computer Science Department, University of Ottawa, Ottawa, Ontario, Canada KIN 9B4, Canada

Abstract

We present a cost-optimal parallel algorithm for generating variations of m elements out of {0, 1, …, n - 1} in lexicographic order. It uses a linear array of m processors, each having constant size memory and each being responsible for producing one part of a given variation. Binary and decimal counters are special cases of the algorithm, when n = 2 and n = 10, respectively. To our knowledge, the algorithm presented here is the first to be published with the property that the delay between any two variations generated is constant.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626491000094

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On generation of permutations of m out of n items;Information Processing Letters;2017-08

2. Listing combinatorial objects in parallel;International Journal of Parallel, Emergent and Distributed Systems;2006-04

3. SYSTOLIC GENERATION OF k-ARY TREES;Parallel Processing Letters;1999-03