1. Shodhbhagirathi @ IITR
  2. ELECTRONICS AND COMMUNICATION ENGINEERING (FORMERLY ELECTRONICS & COMPUTER ENGINEERING)
  3. MASTERS' THESES (E & C)
Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9351
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Tej Prakash-
dc.date.accessioned2014-11-19T07:39:14Z-
dc.date.available2014-11-19T07:39:14Z-
dc.date.issued1993-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9351-
dc.guideKumar, Padam-
dc.description.abstractThe processor allocation problem in an n-dimensional hypercube multiprocessor is similar to the conventional memory allocation problem. The main objective in both problems is to maximize the utilization of resources as well as minimize the inherent system fragmentation. Full recognition of various subcubes In a hypercube multiprocessor efficiently Is nontrivial due to the specific structure of the hypercube. In this dissertation we discuss three processor allocation strategies named as Buddy strategy, Gray_code(GC) strategy and Freelist strategy and compare their performance in maximizing the resource utilizationen_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectPROCESSOR ALLOCATION STRATEGIESen_US
dc.subjectHYPERCUBE MULTIPROCESSORen_US
dc.subjectHYPERCUBE MULTIPROCESSORen_US
dc.titlePROCESSOR ALLOCATION STRATEGIES FOR HYPERCUBE MULTIPROCESSORen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number245930en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD245930.pdf4.89 MBAdobe PDFView/Open
Show simple item record


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