• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      One-dimensional partitioning for heterogeneous systems: theory and practice

      Thumbnail
      View / Download
      2.8 Mb
      Author(s)
      Pınar, A.
      Tabak, E. K.
      Aykanat, Cevdet
      Date
      2008-11
      Source Title
      Journal of Parallel and Distributed Computing
      Print ISSN
      0743-7315
      Publisher
      Academic Press
      Volume
      68
      Issue
      11
      Pages
      1473 - 1486
      Language
      English
      Type
      Article
      Item Usage Stats
      212
      views
      193
      downloads
      Abstract
      We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. © 2008 Elsevier Inc. All rights reserved.
      Keywords
      Chain-on-chain partitioning
      Dynamic programming
      Load balancing
      One-dimensional partitioning
      Parallel computing
      Parametric search
      Heuristic programming
      Nuclear propulsion
      Parallel processing systems
      Polynomial approximation
      Chain partitioning
      Empirical studies
      Exact algorithms
      Heterogeneous systems
      Non uniform
      NP-complete
      Optimal load balancing
      Polynomial-time algorithms
      Real time systems
      Permalink
      http://hdl.handle.net/11693/22984
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.jpdc.2008.07.005
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy