This article presents a scheduling algorithm that assigns tasks represented in a directed acyclic graph (DAG). The behavior of the proposed algorithm is compared with the dominant sequence clustering (DSC) algorithm o...
详细信息
This article presents a scheduling algorithm that assigns tasks represented in a directed acyclic graph (DAG). The behavior of the proposed algorithm is compared with the dominant sequence clustering (DSC) algorithm on a set of DAG tests. The tests were carried out on two sets of DAGs, one with tasks of arbitrary duration, and the other with tasks of unit time duration. When comparing the results for each algorithm in terms of parallel computation time, the proposed algorithm is superior in 75% of the cases, equal in 20% of the tests, and in those cases in which DSC outperforms the proposed algorithm (5% of the cases), it can be seen that the planning carried out by DSC uses a greater number of processors than the proposed algorithm, so that the performance in terms of CPU use is lower for DSC. The results obtained show that the proposed algorithm is superior in 100% of the cases when considering the number of processors used.
The proceedings contain 20 papers. The topics discussed include: HLA-based adaptive distributedsimulation of wireless mobile systems;implementation of federation management services over federation community networks...
ISBN:
(纸本)0769519709
The proceedings contain 20 papers. The topics discussed include: HLA-based adaptive distributedsimulation of wireless mobile systems;implementation of federation management services over federation community networks;parallel network simulation under distributed genesis;enabling large-scale multicast simulations by reducing memory requirements;an implementation of the SSF scalable simulation framework on the Cray MTA;Predictable Time Management for Real-Time distributedsimulation;scalable RTI-based parallelsimulation of networks;reducing the size of routing tables for large-scale network simulation;utility analysis of parallelsimulation;a macroscopic behavior model for self-timed pipeline systems;hybrid packet/fluid flow network simulation;large-scale TCP models using optimistic parallelsimulation;and Maya: a multi-paradigm network modeling framework for emulating distributed applications.
In previous work we have introduced JavaSymphony, a system whose purpose is to simplify the development of distributed and parallel Java applications. JavaSymphony is a Java library that allows to control parallelism,...
详细信息
ISBN:
(纸本)076951880X
In previous work we have introduced JavaSymphony, a system whose purpose is to simplify the development of distributed and parallel Java applications. JavaSymphony is a Java library that allows to control parallelism, load balancing, and locality at a high level. Objects can be explicitly distributed and migrated within virtual architectures, which impose a virtual hierarchy on a distributed system of physical computing nodes. In this paper we present the design of the JavaSymphony Runtime System and the JavaSymphony Shell. Moreover we discuss details about an agent-based implementation of the JavaSymphony Runtime System which comprises the Network Agent, Object Agent, and Event Agent. We present a detailed comparison of the functionality provided by JavaSymphony with several related systems.
Dynamic parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merg...
详细信息
ISBN:
(纸本)076951880X
Dynamic parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic flow graphs). The graphs and the mapping of operations to processing nodes are specified dynamically at runtime. DPS applications are pipelined and multithreaded by construction, ensuring a maximal overlap of computations and communications. DPS applications can call parallel services exposed by other DPS applications, enabling the creation of reusable parallel components. The DPS framework relies on a C++ class library. Thanks to its dynamic nature, DPS offers new perspectives for the creation and deployment of parallel applications running on server clusters.
Large-scale parallel discrete event simulations of massive networks, such as the Internet, are "Grand Challenge" problems: packet level simulation of even a small fraction of the Internet would consume the r...
详细信息
ISBN:
(纸本)0769519709
Large-scale parallel discrete event simulations of massive networks, such as the Internet, are "Grand Challenge" problems: packet level simulation of even a small fraction of the Internet would consume the resources of the most powerful computers available. We reimplement the SSF Scalable simulation Framework so we can run large-scale network simulations originally written for DaSSF Our implementation, CraySSF is designed for the Cray-MTA, a multi-threaded supercomputer architecture developed specifically to address large-scale computations of the kind that are not easily distributed. This paper describes the architecture, implementation issues, and preliminary performance results on a variety of (stock) serial and parallel architectures.
This paper introduces a technique to control the overhead of time management processes in order to make such mechanisms appropriate for real-time distributedsimulation. A novel message accounting scheme, the offset-e...
详细信息
ISBN:
(纸本)0769519709
This paper introduces a technique to control the overhead of time management processes in order to make such mechanisms appropriate for real-time distributedsimulation. A novel message accounting scheme, the offset-epoch method, is presented as a way to increase the efficiency of time management algorithms by eliminating transient messages. A synchronized lower-bound on timestamp (LBTS) computation exploits this efficiency to reduce time management overheads. This approach represents one step in bridging the gap that now exists between analytic and real-time distributedsimulations.
Time-parallelsimulation defines a methodology that can be applied to certain specific simulation problems. In this paper, we present a time-parallel approach for trace-driven simulation of the CSMA/CD protocol. The &...
详细信息
ISBN:
(纸本)0769519709
Time-parallelsimulation defines a methodology that can be applied to certain specific simulation problems. In this paper, we present a time-parallel approach for trace-driven simulation of the CSMA/CD protocol. The "memoryless" property of the physical system under moderate traffic loads allows for efficient time-parallelsimulation. We also present two optimization techniques: the estimation of idle points and the incremental fix-up computation. The former can improve the probability that a subtrace begins with a known initial system state. The latter can speedup the fix-up computation that is required when the estimation of the initial state is incorrect.
This article describes and compares two parallel implementations of Branch-and-Bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the spe...
详细信息
ISBN:
(纸本)076951880X
This article describes and compares two parallel implementations of Branch-and-Bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the specific characteristics of the Branch-and-Bound technique. This information is combined with the provided resolution skeletons to obtain a distributed and a shared parallel programs. MPI has been used to develop the Message Passing algorithm and for the Shared Memory one OpenMP has been chosen. Computational results for the 0/1 Knapsack Problem on a Sunfire 6800 SMP, a Origin 3000 and a PCs cluster are presented.
暂无评论