Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/9261
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta, Atul-
dc.date.accessioned2014-11-19T05:40:46Z-
dc.date.available2014-11-19T05:40:46Z-
dc.date.issued1994-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9261-
dc.guideKumar, Padam-
dc.description.abstractThe classical multiprocessor scheduling problem is the problem of scheduling the tasks of a precedence-constrained task graph (representing a parallel program ) onto the processors of a multiprocessor in a way that minimizes the completion time. This problem is an NP hard problem and has proven difficult both in theory and practice. Because of the intractability of this problem, research effort has focused on finding polynomial time algorithm that produce suboptimal schedules for some restricted cases of the general scheduling problem. In this thesis a heuristic algorithm for the multiprocessor scheduling problem has been implemented and tested where the effects of considering non-negligible inter-task and inter-processor communications are analyzed. The algorithm incorporates a better 'tie-resolution'. We show that the Inter-Task-Communication considerations are very important for optimal scheduling of tasks on multiprocessor.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectDF SCHEDULINNG PRECEDENCE-GRAPHSen_US
dc.subjectHYPERCUBEen_US
dc.subjectINTER-TASK-COMMUNICATIONen_US
dc.titlePERFORMANCE EVALUATION" DF SCHEDULINNG PRECEDENCE-GRAPHS ON HYPERCUBEen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246586en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD246586.pdf2.29 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.