Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9351| Title: | PROCESSOR ALLOCATION STRATEGIES FOR HYPERCUBE MULTIPROCESSOR |
| Authors: | Agarwal, Tej Prakash |
| Keywords: | ELECTRONICS AND COMPUTER ENGINEERING;PROCESSOR ALLOCATION STRATEGIES;HYPERCUBE MULTIPROCESSOR;HYPERCUBE MULTIPROCESSOR |
| Issue Date: | 1993 |
| Abstract: | The 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 utilization |
| URI: | http://hdl.handle.net/123456789/9351 |
| Other Identifiers: | M.Tech |
| Research Supervisor/ Guide: | Kumar, Padam |
| metadata.dc.type: | M.Tech Dessertation |
| Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ECD245930.pdf | 4.89 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.