Name
Abstract | ||
|---|---|---|
We demonstrate circuits that generate set and integer partitions on a set S of n objects at a rate of one per clock. Partitions are ways to group elements of a set together and have been extensively studied by researchers in algorithm design and theory. We offer two versions of a hardware set partition generator. In the first, partitions are produced in lexicographical order in response to successive clock pulses. In the second, an index input determines the set partition produced. Such circuits are useful in the hardware implementation of the optimum distribution of tasks to processors. We show circuits for integer partitions as well. Our circuits are combinational. For large n, they can have a large delay. However, one can easily pipeline them to produce one partition per clock period. We show (1) analytical and (2) experimental time/complexity results that quantify the efficiency of our designs. For example, our results show that a hardware set partition generator running on a 100MHz FPGA produces partitions at a rate that is approximately 10 times the rate of a software implementation on a processor running at 2.26GHz. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2629472 | TRETS |
Keywords | Field | DocType |
partition tree,algorithms,design,reconfigurable computer,set partition,design styles,high-speed arithmetic,partition diagram,types and design styles,index to partition generator,combinatorial objects,performance,integer partition | Algorithm design,Computer science,Parallel computing,Field-programmable gate array,Partition of a set,Lexicographical order,Electronic circuit,Computer hardware,Graph partition,Partition (number theory),Partition refinement | Journal |
Volume | Issue | ISSN |
7 | 4 | 1936-7406 |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jon T. Butler | 1 | 321 | 42.77 |
| Tsutomu Sasao | 2 | 1083 | 141.62 |