In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU a...
详细信息
ISBN:
(纸本)9780769546766
In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU according to the size of the branch and bound list. A better management of GPUs memories, less GPU-CPU communications and better synchronization between GPU threads are proposed in this new implementation in order to increase efficiency. Indeed, a series of computational results is displayed and analyzed showing a substantial speedup on a Tesla C2050 GPU.
the proceedings contain 3 papers. the topics discussed include: the benefits of service choreography for data-intensive computing;rebuilding Debian using distributedcomputing;and deployment and management of large pl...
ISBN:
(纸本)9781605585888
the proceedings contain 3 papers. the topics discussed include: the benefits of service choreography for data-intensive computing;rebuilding Debian using distributedcomputing;and deployment and management of large planar reflectarray antennas simulation on grid.
distributed simulation enables participants situated in different geographical locations to share a common virtual world, which is called a distributed Virtual Environment (DVE). Among the different research topics co...
详细信息
ISBN:
(纸本)0769520367
distributed simulation enables participants situated in different geographical locations to share a common virtual world, which is called a distributed Virtual Environment (DVE). Among the different research topics concerned with DVEs, there is a current trend of linking Multi-Agent systems and DVEs together. Withthe properties of autonomy, social ability, reactivity and proactiveness, agents can be used to represent entities in DVEs, where fast and accurate decision making is a determining factor of the whole environment. this paper provides a description of integrating agents into an HLA-based distributed simulation. It focuses on how to construct the sensor of an agent with different interest management schemes. Using the JADE (Java Agent DEvelopment Framework) agent toolkit and the High Level Architecture (HLA) in our prototype, a minesweeping game, we outline two different implementations of this game. Due to the dynamic characteristics of agents, a problem of overdue information from the environment is discussed, and we propose an enlarged subscription region method to solve this problem. Moreover, advisories provided by the HLA are adopted to reduce the overheads. Conclusions are drawn based on the experimental results of these implementations.
the distributed Virtual Communication Machine (DVCM) is an extensible communication architecture for tightly-coupled clusters of workstations (COWs) connected by high-speed networks. the DVCM is designed for off-the-s...
详细信息
ISBN:
(纸本)0818685794
the distributed Virtual Communication Machine (DVCM) is an extensible communication architecture for tightly-coupled clusters of workstations (COWs) connected by high-speed networks. the DVCM is designed for off-the-shelf network interface cards equipped with communication coprocessors. Its main component is an "active backplane" implemented in firmware running on the coprocessors. this "backplane" can be extended with modules that implement application-specific functionality and have access to some of the application's state. Consequently, non-trivial collective computations can be implemented as DVCM extensions. We present a DVCM extension module that provides application-specific network flow control by coordinating the resource-competing components of a parallel application running on an ATM LAN. Our experiments show that this extension module helps eliminate message loss and achieve high link bandwidth utilization when there is significant link contention.
this paper proposes a performance evaluation model for effective job scheduling in global computing systems. the proposed model represents a global computing system by a queueing network, in which servers and networks...
详细信息
ISBN:
(纸本)0818685794
this paper proposes a performance evaluation model for effective job scheduling in global computing systems. the proposed model represents a global computing system by a queueing network, in which servers and networks are represented by queueing systems. Evaluation of the proposed model showed that the model could simulate behavior of an actual global computing system and job scheduling on the system effectively.
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm requires a huge amount of computational resources. the efficiency of such algorithm can be improved by distributing at larg...
详细信息
ISBN:
(纸本)9780769528335
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm requires a huge amount of computational resources. the efficiency of such algorithm can be improved by distributing at large scale the computation required by the exploration of the search tree. In this paper we propose parallelBB, which is a P2P-based parallelization of the Branch-and-Bound algorithm for the computational Grid. the algorithm has been implemented using the ProActive distributed object Grid middleware. the algorithm has been applied to a monocriterion permutation flow-shop problem and promisingly experimented on the Grid5000 computational Grid.
In this paper we focus on distributed visualization using the Visualization Toolkit (VTK) in grid environments. We propose a distributed architecture, based on data parallelism, that allows the distribution of visuali...
详细信息
ISBN:
(纸本)9780769528335
In this paper we focus on distributed visualization using the Visualization Toolkit (VTK) in grid environments. We propose a distributed architecture, based on data parallelism, that allows the distribution of visualization tasks over a grid environment. We decided for Globus Toolkit as a middleware to provide access and location transparencies. We also add facilities for dynamic allocation of resources by using a Java framework. the focused visualization technique is Laplacian smoothing which is provided by a specific filter of the VTK library. We emphasize the obtained speedup in the experiments and discuss the implementation of pipeline parallelism as well as the generalization of our architecture for other VTK applications.
the complexity of parallel I/O systems imposes significant challenge in managing and utilizing the available system resources to meet application performance, portability and usability goals. We believe that a paralle...
详细信息
ISBN:
(纸本)0818685794
the complexity of parallel I/O systems imposes significant challenge in managing and utilizing the available system resources to meet application performance, portability and usability goals. We believe that a parallel I/O system that automatically selects efficient I/O plans for user applications is a solution to this problem. In this paper, we present such an automatic performance optimization approach for scientific applications performing collective I/O requests on multidimensional arrays. the approach is based on, a high level description of the target workload and execution. environment characteristics, and applies genetic algorithms to select high quality I/O plans. We have validated this approach in the Panda parallel I/O library. Our performance evaluations on the IBM SP show that this approach can, select high quality I/O plans under a variety of system conditions with a low overhead, and the genetic algorithm-selected I/O plans are in general better than the default plans used in Panda.
this paper presents a distributed file-system for the present day medium-sized network. Existing servers and workstations pool their unused storage resources to form a communal share. Erasure codes provide fault toler...
详细信息
暂无评论