Andere Kunden interessierten sich auch für
![Efficient Synchronized Data Distribution Management in Distributed Simulations]( "Efficient Synchronized Data Distribution Management in Distributed Simulations")
Efficient Synchronized Data Distribution Management in Distributed Simulations32,99 €![Greening Video Distribution Networks]( "Greening Video Distribution Networks")
Greening Video Distribution Networks33,99 €![Improving the multi-tasks distribution in multi-robot systems]( "Improving the multi-tasks distribution in multi-robot systems")
Improving the multi-tasks distribution in multi-robot systems24,99 €![Handbook of Graph Grammars and Computing by Graph Transformation - Volume 3: Concurrency, Parallelism, and Distribution]( "Handbook of Graph Grammars and Computing by Graph Transformation - Volume 3: Concurrency, Parallelism, and Distribution")
Handbook of Graph Grammars and Computing by Graph Transformation - Volume 3: Concurrency, Parallelism, and Distribution181,99 €![A Comprehensive Guide to Factorial Two-Level Experimentation]( "A Comprehensive Guide to Factorial Two-Level Experimentation")
A Comprehensive Guide to Factorial Two-Level Experimentation119,99 €![Technologies for Electrical Power Conversion, Efficiency, and Distribution]( "Technologies for Electrical Power Conversion, Efficiency, and Distribution")
Technologies for Electrical Power Conversion, Efficiency, and Distribution176,99 €![Content Distribution Network''s Technology (CDN)]( "Content Distribution Network''s Technology (CDN)")
Content Distribution Network''s Technology (CDN)32,99 €
In my thesis, I have implemented a graph partitioning heuristic in IMUNES system. IMUNES is a program for network emulation/simulation. Since network emulation and simulation are computationally very intensive, a method for dividing the computational load between distributed processors, in a way that minimizes interprocessor communication, is required. The emulation in IMUNES is represented as graph nodes interconnected with links, so the problem of dividing the computational load between processors is reduced to dividing the nodes and edges of the graph, called graph partitioning. After METIS graph partitioning algorithm, I implemented the graph partitioning which has three stages. In the first stage, coarsening, a hierarchy of approximations to the original problem is created. In the second stage an initial solution to the problem is found, which is then iteratively refined in the third stage. In the main part of this thesis I describe the implementation of the three stages of the multilevel partitioning scheme in IMUNES. The main goal was to implement a real-time job partitioning in IMUNES system.