The proceedings contain 26 papers. The special focus in this conference is on Membrane Computing. The topics include: Proton pumping P systems;a binary data structure for membrane processors;parsing with active P auto...
ISBN:
(纸本)354020895X
The proceedings contain 26 papers. The special focus in this conference is on Membrane Computing. The topics include: Proton pumping P systems;a binary data structure for membrane processors;parsing with active P automata;universality of minimal symport/antiport;collapsing hierarchies of parallel rewriting P systems without target conflicts;evolution and observation;tiling rectangular pictures with P systems;simulating boolean circuits with P systems;P systems running on a cluster of computers;implementing in prolog an effective cellular solution to the knapsack problem;a petri net view;P systems generating hexagonal picture languages;a membrane system for the leukocyte selective recruitment;P systems with cutting/recombination rules assigned to membranes;the number of membranes matters;an agent-based behavioural model of monomorium pharaonis colonies;can hyperbolic geometry be of help for P systems;a linear-time solution to the knapsack problem using P systems with active membranes;a reconfigurable hardware membrane system;P systems and petri nets;simulation of mobile ambients by P systems;computing partial recursive functions by transition P systems;P systems with external input and learning strategies;a distributedsimulation of transition P systems and about splicing P systems with immediate communication and non-extended splicing P systems.
In this paper, we propose a novel and efficient fault tolerant routing algorithm for mesh networks based on the concept of k-submesh without virtual channels and not sacrifice non-faulty nodes. Our algorithm is distri...
详细信息
In this paper, we propose a novel and efficient fault tolerant routing algorithm for mesh networks based on the concept of k-submesh without virtual channels and not sacrifice non-faulty nodes. Our algorithm is distributed and local information based. Due to the fact that our algorithm is designed based on k-submesh structure, we apply probabilistic analysis on the fault tolerance of our routing algorithm. Suppose that each node has an independent failure probability, we derive the probability that our routing algorithm successfully returns a fault-free routing path. For example, we formally prove that as long as the node failure probability is bounded by 0.35%, our routing algorithm succeeds in finding a fault-free routing path with high probability of 99% on mesh networks with 250000 nodes. Our algorithm runs in liner time and simulation results show that the length of the routing path constructed by our algorithm are very close to the optimal length.
The automatic recognition of geometric constraints in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. This is a key challenge in many virtua...
详细信息
The automatic recognition of geometric constraints in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. This is a key challenge in many virtual prototype applications, where it is necessary to find collisions precisely and interactively. This paper presents an algorithm to determine intersecting surfaces at interactive speed in a virtual prototyping environment. The proposed algorithm is based on the overlapping axis-aligned bounding box (OAABB). The OAABB concept is used effectively to eliminate the number of surfaces that cannot intersect and improve performance. The algorithm also facilitates the implementation using parallel computing methods. OpenMP is used, taking advantage of shared memory multiple processors and reducing the overall time complexity of the collision detection algorithm. To achieve an efficient parallelsimulation, it is necessary to provide an efficient load balancing scheme. Our experiences in parallelising the code to achieve a better work distribution are also described. Results show that the proposed collision detection achieves interactive rates in real industrial applications as desired.
In this paper, we classify the dynamic, decentralized load balancing algorithms for heterogenous distributed computer systems into three policies: queue adjustment policy (QAP), rate adjustment policy (RAP) and queue ...
详细信息
In this paper, we classify the dynamic, decentralized load balancing algorithms for heterogenous distributed computer systems into three policies: queue adjustment policy (QAP), rate adjustment policy (RAP) and queue and rate adjustment policy (QRAP). We propose two efficient algorithms, referred to as rate based load balancing via virtual routing (RLBVR) and queue based load balancing via virtual routing (QLBVR), which belong to the above RAP and QRAP policies, respectively. We also consider algorithms estimated load information scheduling algorithm (ELISA) that was introduced in the literature, to implement QAP policy. Our focus is to analyze and understand the behaviors of these algorithms in terms of their load balancing ability under varying load conditions (light, moderate, or high) and the minimization of mean response time of jobs. We compare the above classes of algorithms by a number of rigorous simulation experiments to elicit their behavior under some influencing parameters. From these experiments, recommendations are drawn to prescribe the suitability of the algorithms under various situations.
The explosion of WWW traffic has triggered great interest in distributed Web server systems. Among various distributed Web server architectures, the DNS-based distributed system is a promising solution in terms of per...
详细信息
The explosion of WWW traffic has triggered great interest in distributed Web server systems. Among various distributed Web server architectures, the DNS-based distributed system is a promising solution in terms of performance, scalability and availability. DNS (domain name server) name caching has significant effects on the load balance of distributed Web server systems, due to the traffic skewness it causes. Also, there is page caching along whole paths between clients and Web servers, and page caching schemes could affect the system load balancing a lot. In this paper, we examine various caching issues, including the load balancing algorithms of the DNS, the locations of caches, and the page caching policies, for the DNS-based Web server system. We use stochastic processes to model the Web traffic, and compare the load balance performance of these algorithms and policies based on simulation results. We found that, the DNS load balancing algorithm, which takes into account both client domain information and server load information, could yield best load balance performance among various algorithms, and a server-side cache with the policy which only caches popular Web pages could significantly improve both the cache hit ratio and the load balance.
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.
暂无评论