Schilhard Petra (19 results)

Condition: Good. Has some wear and creases. Has a remainder mark. paperback Used - Good 2008.

Condition: New.

Paperback or Softback. Condition: New. Distribution of IMUNES System. Book.

Paperback. Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. In English.

Paperback. Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 72.

Kartoniert / Broschiert. Condition: New. 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 b.

Paperback. Condition: New.

paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Condition: New. Print on Demand pp. 72 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 72.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.; 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.…