Reconfigurable computing systems have developed the capability of changing the configuration of the reconfigurable coprocessor multiple times during the course of a program. However, in most systems the reconfigurable...
详细信息
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p stream processor units, this approach achie...
详细信息
Obsolete hardware can be effectively reused through intelligent software optimization, which is possible only when source code is available. Virtual Distro Dispatcher (VDD) is a system that produces virtual machines o...
详细信息
ISBN:
(纸本)9783540747413
Obsolete hardware can be effectively reused through intelligent software optimization, which is possible only when source code is available. Virtual Distro Dispatcher (VDD) is a system that produces virtual machines on a central server and projects them on a number of costless physical terminals. VDD is the result of an extreme software optimisation based on virtualization and terminal servers. VDD creates and projects Linux distros that are completely customizable and different from each other. They are virtual desktop machines that can be used for testing or developing and are completely controllable directly from each terminal. Memory consumption has been strongly reduced without sacrificing performances. Test results are encouraging to proceed with the research towards clustering.
Due to the rapid improvement in resolution and codec, the number of video sensing device grows fast in the recent years. Tremendous data need to be stored and processed. To meet such a need, we developed a video hosti...
详细信息
ISBN:
(纸本)9781479959679
Due to the rapid improvement in resolution and codec, the number of video sensing device grows fast in the recent years. Tremendous data need to be stored and processed. To meet such a need, we developed a video hosting and processing platform for near-realtime applications. An intelligent device can obtain connection-less upload function from our client-side SDK. Video data are sliced into pieces, distributed over cloud-of-clouds and can be processed in parallel once stored. Various video processing algorithms can be mounted together and processed by multiple CPU cores. Performance evaluations show that our platform has the ability to host and process large-scale video data.
In this paper, we first study the interaction between MPI applications and TCP on grids. Then, we propose MPI5000, a transparent applicative layer between MPI and TCP, using proxies to improve the execution of MPI app...
详细信息
The paper presents a partitioning and parallelizing programming environment for a novel parallel architecture. This universal embedded accelerator is based on a reconfigurable datapath hardware. The partitioning and p...
详细信息
The paper presents a partitioning and parallelizing programming environment for a novel parallel architecture. This universal embedded accelerator is based on a reconfigurable datapath hardware. The partitioning and parallelizing programming environment accepts C-programs and carries out both, a profiling-driven host/ accelerator partitioning for performance optimization in a first step, and in a second step a resource-driven sequential/ structural partitioning of the accelerator source code to optimize the utilization of its reconfigurable resources.
The inter-processor all-to-all communication patterns can be found in many important parallel algorithms. This paper presents new algorithms for all-to-all personalized exchange for circuit switched or wormhole routed...
详细信息
The inter-processor all-to-all communication patterns can be found in many important parallel algorithms. This paper presents new algorithms for all-to-all personalized exchange for circuit switched or wormhole routed 2D and 3D torus connected multiprocessors. The algorithms use message combining to minimize message startups at the expense of larger message sizes. The unique feature of these algorithms is that they are the first algorithms that we know of that operate in a bottom-up fashion rather than a recursive top-down manner.
The software crisis within scientific computing has been that application codes become larger and more complex. The only conceivable solution is to make application codes smaller and less complex. We know of no way to...
Computational fluid dynamics (CFD) simulations require a lot of computing resources in terms of CPU time and memory in order to compute with a reasonable physical accuracy. If only uniformly refined domains are applie...
详细信息
ISBN:
(纸本)9781479930357
Computational fluid dynamics (CFD) simulations require a lot of computing resources in terms of CPU time and memory in order to compute with a reasonable physical accuracy. If only uniformly refined domains are applied, the amount of computing cells is growing rather fast if a certain small resolution is physically required. This can be remedied by applying adaptively refined grids. Unfortunately, due to the adaptive refinement procedures, errors are introduced which have to be taken into account. This paper is focussing on implementation details of the applied adaptive data structure management and a qualitative analysis of the introduced errors by analysing a Poisson problem on the given data structure, which has to be solved in every time step of a CFD analysis. Furthermore an adaptive CFD benchmark example is computed, showing the benefits of an adaptive refinement as well as measurements of parallel data distribution and performance.
We present a randomized parallel algorithm for the Voronoi diagram of line segments on coarse grained parallel machines, which, for any input of n line segments on P processors (n = Ω(P3+Ε), for any Ε > 0) requi...
详细信息
We present a randomized parallel algorithm for the Voronoi diagram of line segments on coarse grained parallel machines, which, for any input of n line segments on P processors (n = Ω(P3+Ε), for any Ε > 0) requires (with high probability) O(n log n/P) local operations, O(n/P) global-operations (or messages) per processor, O(1) levels of global data dependency (or O(1) communication phases). This generic parallel algorithm can be transformed to the CRCW PRAM model in O(log n) time with O(n) processors and thus provides a different solution from and conceptually much simpler than, that of [RR].
暂无评论