Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

The multiprocessor scheduling of precedence-constrained task systems in the presence of...

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
  • المؤلفون: Baruah, Sanjoy K.
  • المصدر:
    Operations Research. Jan/Feb98, Vol. 46 Issue 1, p65. 8p. 4 Diagrams.
  • معلومة اضافية
    • الموضوع:
      PRODUCTION scheduling; TASK analysis; COMMUNICATION & technology; OPERATIONS research; MATHEMATICAL programming; COMPUTER programming; MULTIPROCESSORS
    • نبذة مختصرة :
      The problem of scheduling precedence-constrained task systems characterized by interprocessor communication delays is addressed. It is assumed that task duplication is permitted. The target machine is a homogenous multiprocessor with an unbounded number of processors. The general problem is known to be NP-hard; however, when communication delays are small relative to task execution times, the C.P.M. based approach of Colin and Chretienne (1991) yields an optimal schedule in polynomial time. Extensions to this method of Colin and Chretienne are presented here, which allow for polynomial-time optimal schedule generation for certain categories of task systems with arbitrary, precedence relations, processing times, and communication delays. [ABSTRACT FROM AUTHOR]
    • نبذة مختصرة :
      Copyright of Operations Research is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)