




S. No. 
Chapter 
Title of the Chapters 
Page 
Size (KB) 





1 
0 
Contents 

87.47 KB 





2 
1 
Introduction 
1 
67.38 KB 





3 
2 
A Comparative Analysis Of Static & Dynamic Load Balancing Strategies 
8 
338.88 KB 

2.1 
Introduction 


2.2 
Formulation of Problem 


2.3 
The Optimal Static Algorithm 


2.4 
The Binary Dissection Method 


2.5 
The Greedy Algorithm 


2.6 
The Predictive Dynamic Load Balancing Method 


2.7 
Comparison of Results 


2.7 
Conclusions 






4 
3 
Approximate Algorithms For Partitioning And Assignment Problems 
41 
386.88 KB 

3.1 
Introduction 


3.2 
An Algorithm for Partitioning Chains 


3.3 
Partitioning Multiple Chains across a HostSetellite System 


3.4 
Partitioning Distributed Programs in HostSatellite System 


3.5 
Partitioning Chains in Shared Memory System 


3.6 
Partitioning Trees in HostSatellite System 


3.7 
Conclusions 






5 
4 
Efficient Algorithms For Partitioning Problems 
82 
334.86 KB 

4.1 
Introduction 


4.2 
An Algorithm for Partitioning Chains 


4.3 
Partitioning Multiple Chains across a HostSatellite System 


4.4 
Partitioning Trees in HostSatellite System 


4.5 
Conclusions 






6 
5 
Partitioning And Assignment Problems For Binary Trees 
115 
377.87 KB 

5.1 
Introduction 


5.2 
Definitions 


5.3 
An Scheme to Partition a Binary Tree 


5.4 
Decomposition & Assignment Strategies 



Conclusions 






7 
6 
Efficient Algorithms For Dilated Mappings Of Binary Trees 
154 
344.35 KB 

6.1 
Introduction 


6.2 
Definitions 


6.3 
An Algorithm to Find a DilatedMapping 


6.4 
Applications 


6.5 
Conclusions 






8 
7 
Conclusions 
192 
66.94 KB 




