首页 | 本学科首页   官方微博 | 高级检索  
     


Parallel Self-Index Integer Sorting
Authors:Hazem M. Bahig  Sameh S. Daoud  Mahmoud K. A. Khairat
Affiliation:(1) Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt
Abstract:We consider the problem of sorting n integers when the elements are drawn from the restricted domain [1...n]. A new deterministic parallel algorithm for sorting n integers is obtained. Its running time is O(lognlog(n/logn)) using n/logn processors on EREW (exclusive read exclusive write) PRAM (parallel random access machine). Also, our algorithm was modified to become optimal when we use 
$$sqrt n$$
processors. This algorithm belongs to class EP (Efficient, Polynomial fast).
Keywords:parallel algorithms  self-index  integer sorting  EREW PRAM  optimal algorithms
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号