• 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.

      Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories

      Thumbnail
      View / Download
      634.2 Kb
      Author(s)
      Kaya, K.
      Uçar, B.
      Aykanat, Cevdet
      Date
      2007
      Source Title
      Journal of Parallel and Distributed Computing
      Print ISSN
      0743-7315
      Publisher
      Academic Press
      Volume
      67
      Issue
      3
      Pages
      271 - 285
      Language
      English
      Type
      Article
      Item Usage Stats
      233
      views
      217
      downloads
      Abstract
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent tasks. The files initially reside on the repositories. The processors and the repositories are connected through a heterogeneous interconnection network. Our aim is to assign the tasks to the processors, to schedule the file transfers from the repositories, and to schedule the executions of tasks on each processor in such a way that the turnaround time is minimized. We propose a heuristic composed of three phases: initial task assignment, task assignment refinement, and execution ordering. We experimentally compare the proposed heuristics with three well-known heuristics on a large number of problem instances. The proposed heuristic runs considerably faster than the existing heuristics and obtains 10-14% better turnaround times than the best of the three existing heuristics. © 2006 Elsevier Inc. All rights reserved.
      Keywords
      Grid computing
      Heterogeneous computing systems
      Scheduling
      Computation theory
      Data storage equipment
      Distributed computer systems
      Problem solving
      Program processors
      Scheduling
      Execution ordering
      Heuristic methods
      Permalink
      http://hdl.handle.net/11693/23529
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.jpdc.2006.11.004
      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