scientific article; zbMATH DE number 2040827

MaRDI QIDQ4451921zbMATH OpenFDO

Authors Ling Chen, Yi Pan

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2745/27450209.htm

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system
• Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses
• Sorting on PRAMs with reconfigurable buses
• Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers

Cited in

(7)

• An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system
• Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses
• More efficient topological sort using reconfigurable optical buses
• Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
• Repetitions detection on a linear array with reconfigurable pipelined bus system
• Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
• Constant time sorting on a processor array with a reconfigurable bus system

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451921)