Abstract
We investigate the complexity of computing an optimal m-processor schedule for a system of n unit execution time tasks constrained by an interval order, subject to unit delays for interprocessor communication. Our results are twofold. First, we show that the problem can be solved by a sequential algorithm in linear time. Second, we present a fast parallel algorithm that solves the problem on the EREW PRAM in time O( log 2 n) using n 3/ log n processors and on the CRCW PRAM in time O( log n) using n 3 processors. This is the first NC algorithm for this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
