Title page for etd-0119106-120724


[Back to Results | New Search]

URN etd-0119106-120724
Author Shyue-Horng Shiau
Author's Email Address shiaush@mail.cju.edu.tw
Statistics This thesis had been viewed 4663 times. Download 934 times.
Department Computer Science and Engineering
Year 2005
Semester 1
Degree Ph.D.
Type of Document
Language English
Title Partial Sort and Its Applications on Single-Hop Wireless Networks
Date of Defense 2006-01-17
Page Count 106
Keyword
  • partial sort
  • initialization
  • parallel algorithm
  • quicksort
  • broadcast
  • insertion sort
  • Abstract In this dissertation, we focus on the study of the partial sorting (generalized sorting) problem and the initialization problem. The partial sorting problem is
    to find the first k smallest (or largest) elements among n input elements and to report them in nondecreasing (or nonincreasing). The initialization problem on a multiprocessor system is to assign each of n input elements a unique identification number, from 1 to n. This problem can be regarded as a special case of the sorting problem in which all input elements have the same value. We propose
    some algorithms for solving these problems. The main result is to give precise analysis for these algorithms.
    On the traditional model, we modify two algorithms, based on insertion sort and quicksort, to solve the partial sorting problem. Our analysis figures out the whole race between the two partial sorting algorithms and shows that the partial insertion sort algorithm obtains the leading position from k = 1 (the beginning) until k  3
    5pn. After that, the partial quicksort algorithm will take the leading position on the way to the end.
    We also extend the partial sorting problem on the Single-Hop wireless network with collision detection (WNCD) model. The extension fits in with the wireless trend and may be a foundation for studying divide-and-conquer. With the repeat
    maximum finding scheme, we propose a partial sorting algorithm and prove that its average time complexity is (k + log (n − k)). For the initialization problem on the WNCD model, we can invoke the sorting algorithms directly for solving it. However, those sorting algorithms would not be better than the method of building a partition tree. We show that the partition tree method requires 2.88n time slots in average. After reconstructing and analyzing the method, we improve the result from 2.88n to 2.46n.
    Advisory Committee
  • Sing Ling Lee - chair
  • D. J. Guan - co-chair
  • Yaw-Ling Lin - co-chair
  • Shi-Jinn Horng - co-chair
  • Y. L. Wang - co-chair
  • Biing-Feng Wang - co-chair
  • Rong-Jaye Chen - co-chair
  • Hsien-Kuei Hwang - co-chair
  • C. B. Yang - advisor
  • Files
  • etd-0119106-120724.pdf
  • indicate access worldwide
    Date of Submission 2006-01-19

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys