PARALLEL QUICKSORT WITHOUT MEMORY CONFLICTS
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A parallel quicksort algorithm is given and which,given an EREW PRAM with k processors,sorts n items in expected O((n/k+logn)logn)time.and thus the prod-uct of time and number of processors is O(nlogn)on the average for any value ofkn/(logn).

    Reference
    Related
    Cited by
Get Citation

管丽.无存储器冲突的并行快速排序算法*.软件学报,1996,7(zk):249-253

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 23,1995
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063