The proceedings contain 42 papers. The special focus in this conference is on Experimental and Efficient Algorithms. The topics include: A hybrid bin-packing heuristic to multiprocessor scheduling;efficient edge-swapp...
ISBN:
(纸本)3540220674
The proceedings contain 42 papers. The special focus in this conference is on Experimental and Efficient Algorithms. The topics include: A hybrid bin-packing heuristic to multiprocessor scheduling;efficient edge-swapping heuristics for finding minimum fundamental cycle bases;solving chance-constrained programs combining tabu search and simulation;an algorithm to identify clusters of solutions in multimodal optimisation;on an experimental algorithm for revenue management for cargo airlines;cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem;simple max-cut for split-indifference graphs and graphs with few P4’s;a randomized heuristic for scene recognition by graph matching;an efficient implementation of a joint generation algorithm;lempel, even, and cederbaum planarity method;a greedy approximation algorithm for the uniform labeling problem analyzed by a primal-dual technique;distributed circle formation for anonymous oblivious robots;dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems;engineering shortest path algorithms;how to tell a good neighborhood from a bad one;implementing approximation algorithms for the single-source unsplittable flow problem;fingered multidimensional search trees;faster deterministic and randomized algorithms on the homogeneous set sandwich problem;efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm and combining speed-up techniques for shortest-path computations.
This paper presents wrapping techniques that we have developed in order to integrate applications into the scientific workflow management system TENT. These techniques take into account the varying degrees of controll...
详细信息
This paper presents wrapping techniques that we have developed in order to integrate applications into the scientific workflow management system TENT. These techniques take into account the varying degrees of controllability found for each application and utilize various kinds of communication mechanisms between application and the associated wrapper. We also give an outline of the principles of component technology employed in the CORBA based TENT environment. In addition, the means by which applications can be connected through their associated wrappers and TENT components to form distributed workflows are presented. It is demonstrated how TENT provides the user with a homogeneous perspective on scientific workflows running in a distributed environment and how he is enabled to efficiently configure and control these workflows by means of the TENT component model.
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.
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.
There is a wide-spread usage of hardware design languages(HDL) to speed up the time-to-market for the design of modern digital systems. Verification engineers can simulate hardware in order to verify its performance a...
详细信息
ISBN:
(纸本)0769519709
There is a wide-spread usage of hardware design languages(HDL) to speed up the time-to-market for the design of modern digital systems. Verification engineers can simulate hardware in order to verify its performance and correctness with help of an HDL. However simulation can't keep pace with the growth in size and complexity of circuits and has become a bottleneck of the design process. distributed HDL simulation on a cluster of workstations has the potential to provide a cost-effective solution to this problem. In this paper we describe the design and implementation of DVS, an object-oriented framework for distributed Verilog simulation. Verilog is an HDL which sees wide industrial use. DVS is an outgrowth of Clustered Time Warp, originally developed for logic simulation. The design of the framework emphasizes simplicity and extensibility and aims to accommodate experiments involving partitioning and dynamic load balancing. Preliminary results obtained by simulating a 16bit multiplier are presented.
We present a classification that groups lookback into four types: direct strong lookback, universal strong lookback, direct weak lookback, and universal weak lookback. They are defined in terms of absolute and dynamic...
详细信息
ISBN:
(纸本)0769519709
We present a classification that groups lookback into four types: direct strong lookback, universal strong lookback, direct weak lookback, and universal weak lookback. They are defined in terms of absolute and dynamic impact times. We discuss relationships between lookback types by considering,when rollbacks and/or anti-messages are avoided From different types of lookback, we also derive three optimization techniques for optimistic simulation and point out their advantages over lazy cancellation. Finally, we show that all four types of lookback exist in the PCS network simulation and can be exploited by either lookback-based or optimistic protocols.
暂无评论