Parallel Algorithms for Fully Dynamic Maintenance of Extremal Sets in

Parallel Algorithms for Fully Dynamic Maintenance of Extremal Sets in

Cached

Download Links

[www.cit.gu.edu.au]

by Log Time , Log N , Hong Shen

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Parallel Algorithms for Fully Dynamic Maintenance of Extremal Sets in	user correction - Legacy Corrections
AUTHOR NAME	Log Time	user correction - Legacy Corrections
AUTHOR NAME	Log N	user correction - Legacy Corrections
AUTHOR NAME	Hong Shen	user correction - Legacy Corrections
AUTHOR AFFIL	School of Computing and Information Technology; Griffith University	user correction - Legacy Corrections
AUTHOR ADDR	Nathan, QLD 4111, Australia	user correction - Legacy Corrections
ABSTRACT	Let F be a family of sets containing N elements. The extremal sets of F are those that have no subset or superset in F and are hence minimal or maximal respectively. We consider the problem of maintaining all extremal sets in F in parallel when F undergoes dynamic updates including set insertion, deletion and set-contents update (insertion, deletion and value update of elements). We present a set of parallel algorithms that, using O( N log N ) processors on a CREW PRAM, maintain all extremal sets of F in O(logN ) time per set insertion, deletion and set-contents update in the worst case. We also show that a batch of q queries on whether a set of F is minimal and/or maximal can be answered in O(1) time using q CREW processors. With a cost matching the time complexity of the optimal sequential algorithm [7], our algorithms are the first known NC algorithms that use a sub-linear number of processors for fully dynamic maintenance of extremal sets of F . Keywords: CREW PRAM, dynamic a...	user correction - Legacy Corrections
CITATIONS	10 found	ParsCit 1.0