Artificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known ...
详细信息
ISBN:
(纸本)9781424416936
Artificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. this paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. the performance of the algorithm over a set of well-established benchmark graphs and random graphs is compared with a parallel Tabu Search algorithm.
Energy consumption is a critical issue in parallel and distributed embedded systems. We present a novel algorithm for energy efficient scheduling of Directed Acyclic Graph (DAG) based applications on Dynamic Voltage S...
详细信息
ISBN:
(纸本)9781424416936
Energy consumption is a critical issue in parallel and distributed embedded systems. We present a novel algorithm for energy efficient scheduling of Directed Acyclic Graph (DAG) based applications on Dynamic Voltage Scaling (DVS) enabled systems. Experimental results show that our algorithm provides near optimal solutions for energy minimization with considerably smaller computational time and memory requirements compared to an existing algorithm that provides near optimal solutions.
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing algorithm. Our preliminary experimenta...
详细信息
ISBN:
(纸本)9781424416936
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing algorithm. Our preliminary experimental results show that the automatic generation of a distributed memory parallel sorting routine provides up to a four fold improvement over standard parallel algorithms with typical parameters. Withthe recent importance of multicore processors, we are extending this work to shared memory. this provides new challenges specific to multicore systems. However, withtheir increasing popularity, this extension becomes very valuable.
About ten years after the Java Grande effort, this paper aims at providing a snapshot of the comparison of Fortran MPI, with Java performance for parallel computing, using the ProActive library. We first analyze some ...
详细信息
ISBN:
(纸本)9781424416936
About ten years after the Java Grande effort, this paper aims at providing a snapshot of the comparison of Fortran MPI, with Java performance for parallel computing, using the ProActive library. We first analyze some performance details about ProActive behaviors, and then compare its global performance from the MPI library. this comparative is based on the five kernels of the NAS parallel Benchmarks. From those experiments we identify benchmarks where parallel Java performs as well as Fortran MPI, and lack of performance on others, together with clues for improvement.
Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined by the means of an automated rule gener...
详细信息
ISBN:
(纸本)9781424416936
Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined by the means of an automated rule generation procedure and simulation. Genetic programming is applied as the creator and optimizer of the rules. A simulator is used for the fitness evaluation and distributed over a number of machines. Some example results suggest that the approach could be successfully applied in the real world as the results are more than human competitive.
this paper presents and evaluates a parallel Java implementation of the Finite-Difference Time-Domain (FDTD) method, which is a widely used numerical technique in computational electrodynamics. the Java version is par...
详细信息
ISBN:
(纸本)9781424416936
this paper presents and evaluates a parallel Java implementation of the Finite-Difference Time-Domain (FDTD) method, which is a widely used numerical technique in computational electrodynamics. the Java version is parallelized using MPJ Express-a thread-safe messaging library. MPJ Express provides a full implementation of the mpiJava 1.2 API specification. this specification defines a MPI-like binding for the Java language. this paper describes our experiences of implementing the Java version of the FDTD method. Towards the end of this paper, we evaluate and compare the performance of the Java version against its C counterpart on a 32 processing core Linux cluster of eight compute nodes.
Monitoring the execution of distributed tasks within the workflow execution is not easy and is frequently controlled manually. this work presents a lightweight middleware monitor to design and control the parallel exe...
详细信息
In this paper, we extend the strategic default bankruptcy model to predict risky premium on defaultable bonds in a more realistic economic environment. By considering interest rates, taxes and the voltality of busines...
详细信息
ISBN:
(纸本)9781424416936
In this paper, we extend the strategic default bankruptcy model to predict risky premium on defaultable bonds in a more realistic economic environment. By considering interest rates, taxes and the voltality of business operations, the model becomes considerably complicated, which imposes significant challenges on the mathematical framework as well as the computation power required in simulating the stochastic process. Since it is hard to obtain a closed form analytical solution for the framework, numerical simulation is an alternative. We present a dynamic block allocation algorithm for parallel Quasi-Monte Carlo(QMC) simulation. the convergence speed of the model is also studied. Simulation results show that our model can be used to estimate risk and risk premium in financial economics.
Lucrative incentives in grid computing do not only attract honest participants, but also cheaters. To prevent selfish behavior verification mechanisms are required. Today's solutions mostly base oil redundancy and...
详细信息
ISBN:
(纸本)9781424416936
Lucrative incentives in grid computing do not only attract honest participants, but also cheaters. To prevent selfish behavior verification mechanisms are required. Today's solutions mostly base oil redundancy and inherently exhibit a considerable overhead. Often, however, the verification of a result takes much less time than its computation. In this paper we propose a distributed checking scheme that exploits this asymmetry. Our mechanism detects wrong results and excludes cheaters in a distributed manner and hence disburdens the central of the grid server. We show how the verification scheme is used in an application which aims at breaking the discrete logarithm problem by a parallel implementation of the Pollard-rho algorithm. Our implementation extends the BOINC server software and is robust to various rational attacks even in the presence of colluders.
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. the distributed applicat...
详细信息
ISBN:
(纸本)9781424416936
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. the distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on the resources they require. thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of mapping application-level requirements onto the network it? such a manner that the requirements of the application are realized. We present two new techniques to tackle this combinatorially-hard problem that thanks to a number of heuristics, are able to find feasible solutions or determine the non-existence of a solution in most cases, where otherwise the problem would be intractable. these techniques are also false negative free, a common problem among other heuristics currently in use.
暂无评论