The MicroGrid: A Scientific Tool for Modeling Computational Grids

Song, Hoseok; Liu, X.; Jakobsen, D.; Bhagwan, Ranjita; Zhang, X.; Taura, Kenjiro

doi:10.1155/2000/481921

Cited by 69 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In all but the simplest cases, determining a suitable and efficient mapping is challenging and requires considerable analysis of the traffic patterns between the simulated network elements. Liu and Chien [22] describe an automated method to partition networks which they used in their MicroGrid [23] emulation tool. These results seem promising, and we are investigating their applicability to our ghost node approach for space-parallel network simulation.…”

Section: Discussionmentioning

confidence: 99%

Space-parallel network simulations using ghosts

Riley

Jaafar

Fujimoto

et al. 2004

Proceedings of the Eighteenth Workshop on Parallel and Distributed Simulation - PADS '04

View full text Add to dashboard Cite

We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining spaceparallel simulations. Previous approaches have difficulties that arise from the need for global topology knowledge when forwarding simulated packets between the federates. In all but the simplest cases, proper packet forwarding decisions between federates requires routing tables of size O(mn) (m is the number of nodes modeled in a particular simulator instance, and n is the total number of network nodes in the entire topology) in order to determine how packets should be routed between federates. Further, the benefits of the well-known NIx-Vector routing approach cannot be fully achieved without global knowledge of the overall topology. We seek to overcome these difficulties by utilizing a topology partitioning methodology that uses Ghost Nodes. A ghost node is a simulator object in a federate that represents a simulated network node that is spatially assigned to some other federate, and thus that other federate is responsible for maintaining all state associated with the node. However, ghost nodes do retain topology connectivity information with other nodes, allowing all federate in a space-parallel simulation to obtain a global picture of the network topology. We show with experimental results that the memory overhead associated with the ghosts is minimal relative to the overall memory footprint of the simulation.

show abstract

Section: Discussionmentioning

confidence: 99%

Space-parallel network simulations using ghosts

Riley

Jaafar

Fujimoto

et al. 2004

Proceedings of the Eighteenth Workshop on Parallel and Distributed Simulation - PADS '04

View full text Add to dashboard Cite

show abstract

“…Literature [7][8]were studied on the environment which based on HLA and grid simulation of resource management and load balancing.…”

Section: A the Methods Of Distribution Migrationmentioning

confidence: 99%

“…Monitoring module monitor the running of sub-tasks in the simulation process of the operation, it can get the CPU utilization rate, delay time and port traffic, etc, also can display real timely [7]. Dynamic scheduling module receives the monitoring results information, and then under the dynamic algorithm migrate simulation task to achieve load balancing.…”

Section: The Structure Design Of Simulation Grid Systemmentioning

confidence: 99%

Research of the Simulation Grid System Based on Multi-agent Dynamic Scheduling

Fan

2010

2010 Second International Conference on Computer Modeling and Simulation

View full text Add to dashboard Cite

With the rapid advances in communication and networking, especially in Grid technique, an increasing number of applications will involve computing systems. This article focus that how to schedule system resources in reason and explore the dynamic scheduling method to the parallel tasks in the federation. According to task scheduling of content and objectives in the simulation grid, the HLA federate managements is reformed. The dynamic schedule method based on multi-agent is propose and schedule framework is built, on this basis migration method is designed which based on federation members. And using UML designs migration process. Taking the air-to-ground warfare simulation system as an example, Simulation results verify that the method is feasible, and obviously the method could make contribution to enhance the quotients of using resource and construct the large-scale military simulation applications in simulation

show abstract

“…Some evaluation techniques include: analytical, simulation, emulation and empirical. Some of the notable Grid tools are SimGrid [35] and GridSim [11] for simulation; MicroGrid [36] for emulation; and Nimrod-G [5] that supports creation of pluggable schedulers for empirical evaluation. In addition, empirical evaluation needs system-level Grid middleware such as Globus for deploying jobs securely on Grid testbed resources.…”

Section: Evaluation Methods and Complexity Analysismentioning

confidence: 99%

Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm

Buyya

Murshed

Abramson

et al. 2005

Softw: Pract. Exper.

118

View full text Add to dashboard Cite

Computational Grids and peer-to-peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regulating the supply of and demand for resources and allocating them for applications based on the users' quality-of-service requirements. The framework requires economy-driven deadline-and budgetconstrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users' requirements are met. In this paper, we propose a new scheduling algorithm, called the DBC cost-time optimization scheduling algorithm, that aims not only to optimize cost, but also time when possible. The performance of the cost-time optimization scheduling algorithm has been evaluated through extensive simulation and empirical studies for deploying parameter sweep applications on global Grids.

show abstract

The MicroGrid: A Scientific Tool for Modeling Computational Grids

Cited by 69 publications

References 10 publications

Space-parallel network simulations using ghosts

Space-parallel network simulations using ghosts

Research of the Simulation Grid System Based on Multi-agent Dynamic Scheduling

Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm

Contact Info

Product

Resources

About