On parallel generation of set partitions in associative: Processor architectures

被引：0
|
作者：
Kokosinski, Z [1 ]
机构：
[1] Cracow Univ Technol, Fac Elect & Comp Engn, PL-31155 Krakow, Poland
来源：
INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS | 1999年
关键词：
choice function; partition generation; associative processing;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper a new parallel algorithm is presented for generation of all m-block partitions of n-element set, 1 less than or equal to m less than or equal to n. Computations run in an associative processor model. Objects are generated in lexicographic order, with O(1) time per object. The algorithm is well suited for column/masks generation in associative processors.
引用
收藏
页码：1257 / 1262
页数：6
相关论文
共 50 条
12345