Iqbal, Mohammad Ashraf (1990) MAPPING & ASSIGNMENT PROBLEMS IN MULTIPLE COMPUTER SYSTEMS. PhD thesis, University of Engineering & Technology, Lahore.
Recent advances in VLSI (Very Large Scale Integration) and in automated design tools shave have removed a number of fundamental constraints from computer architecture. Complex processing logic is no longer costly. It is not essential to follow rules of von Neuman architecture in which a single processing unit operates serially on data items that it serially fetches from and restores to memory. It has become technically feasible to design computer structures in which tens of thousands of processors co-operate to solve problems at high speed. Parallel processing can be used to solve problems which can not be solved within an acceptable amount of time with the help of any commercial computer or which must be run on an expensive supercomputer, to which most researchers can only have access infrequently, if at all. The problems that are typically solved on parallel machines include linear system of equations, partial differential equations, signal processing, etc, which arise in many important scientific and engineering applications. The performance of multiple processing system degrades if there is excessive inter communication between processors.
|Item Type:||Thesis (PhD)|
|Uncontrolled Keywords:||load balancing strategies, partitioning problems, assignment problems, computer systems|
|Subjects:||Engineering & Technology (e) > Engineering(e1) > Electrical engineering (e1.16)|
|Deposited By:||Mr. Muhammad Asif|
|Deposited On:||28 Sep 2006|
|Last Modified:||04 Oct 2007 21:00|
Repository Staff Only: item control page