• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Optimal Parallel Selection in Sorted Matrices

    Author(s)
    Shen, Hong
    Ramnath, S.
    Griffith University Author(s)
    Shen, Hong
    Year published
    1996
    Metadata
    Show full item record
    Abstract
    We present a parallel algorithm running in time O(logmlog*m(logm+log(nm))) time and O(mlog(nm)) operations on an EREW PRAM for the problem of selection in an m × n matrix with sorted rows and columns, m ⩽ n. Our algorithm generalizes the result of Sarnath and He (1992) for selection in a sorted matrix of equal dimensions, and thus answers the open question they posted. The algorithm is work-optimal thus improving upon the result in (Sarnath and He, 1992) for the case of square matrices as well. Our algorithm can be generalized to solve the selection problem on a set of sorted matrices of arbitrary dimensions.We present a parallel algorithm running in time O(logmlog*m(logm+log(nm))) time and O(mlog(nm)) operations on an EREW PRAM for the problem of selection in an m × n matrix with sorted rows and columns, m ⩽ n. Our algorithm generalizes the result of Sarnath and He (1992) for selection in a sorted matrix of equal dimensions, and thus answers the open question they posted. The algorithm is work-optimal thus improving upon the result in (Sarnath and He, 1992) for the case of square matrices as well. Our algorithm can be generalized to solve the selection problem on a set of sorted matrices of arbitrary dimensions.
    View less >
    Journal Title
    Information Processing Letters
    Volume
    59
    Issue
    3
    DOI
    https://doi.org/10.1016/0020-0190(96)00100-7
    Subject
    Landscape Ecology
    Mathematical Sciences
    Information and Computing Sciences
    Engineering
    Publication URI
    http://hdl.handle.net/10072/120752
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander