the model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We propose the first optimal deterministic BSP algorithm for computing the convex hull of a set o...
详细信息
ISBN:
(纸本)3540440496
the model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We propose the first optimal deterministic BSP algorithm for computing the convex hull of a set of points in three-dimensional Euclidean space. Our algorithm is based on known fundamental results from combinatorial geometry, concerning small-sized, efficiently constructible e-nets and c-approximations of a given point set. the algorithm generalises the technique of regular sampling, used previously for sorting and two-dimensional convex hull computation. the cost of the simple algorithm is optimal only for extremely large inputs;we show how to reduce the required input size by applying regular sampling in a multi-level fashion.
In the last years the convergence between circuit switched and packet switched communication networks has become more and more important, not at least because of the growing Voice over IP or rather Multimedia over IP ...
详细信息
ISBN:
(纸本)140207008X
In the last years the convergence between circuit switched and packet switched communication networks has become more and more important, not at least because of the growing Voice over IP or rather Multimedia over IP tendency. Currently, network providers from the classical circuit switched world have to think about enabling interconnection to the IP domain over appropriated gateways. Another important issue is the centralization of service logic to make it usable from different types of networks. If this is done over open interfaces, so called 3rd Party Service Providers could offer their services in a more flexible way. Hybrid Components, called softswitches, could fulfil both, gateway functionality and access to centralized applications using standardized interfaces. One possibility for such an interface could be the Parlay API. In this paper we propose three different softswitch architectures supporting connectivity to the PSTN as well as to the IP world. they differ in the placement of network specific components and in the way of gateway control. In each case Parlay is used between the networks specific Call Control and the independent application.
the proceedings contain 140 papers. the special focus in this conference is on parallelprocessing. the topics include: Orchestrating computations on the world-wide web;non-massive, non-high performance, distributed c...
ISBN:
(纸本)3540440496
the proceedings contain 140 papers. the special focus in this conference is on parallelprocessing. the topics include: Orchestrating computations on the world-wide web;non-massive, non-high performance, distributed computing;facts on performance evaluation and its dependence on workloads;concepts and technologies for a worldwide grid infrastructure;a performance analysis tool for distributed and parallel programs;a hybrid strategy for automated performance problem searches;on the scalability of tracing mechanisms;component based problem solving environment;integrating temporal assertions into a parallel debugger;performance evaluation, analysis and optimization;prototyping and verifying stream-processing systems;symbolic cost estimation of parallel applications;performance modeling and interpretive simulation of PIM architectures and applications;extended overhead analysis for openMP;a call-graph based automatic tool for capture of hardware performance metrics for MPI and openMP applications;performance tuning through source code interdependence;on scheduling task-graphs to logP-machines with disturbances;optimal scheduling algorithms for communication constrained parallelprocessing;an automatic scheduler for parallel machines;non-approximability results for the hierarchical communication problem with a bounded number of clusters;non-approximability of the bulk synchronous task scheduling problem;adjusting time slices to apply coscheduling techniques in a non-dedicated now;a semi-dynamic multiprocessor scheduling algorithm with an asymptotically optimal competitive ratio;tiling and memory reuse for sequences of nested loops;towards detection of coarse-grain loop-level parallelism in irregular computations and parallel and distributed databases, data mining and knowledge discovery.
the objective of the parallelism-independent (PI) scheduling is minimization of the completion time of a parallel application for any number of processing elements in the computing system. We propose several paralleli...
详细信息
We study two classical connectivity-preserving parallel shrinking algorithms proposed to recognize and label two-dimensional connected components of binary images. the algorithms we consider were developed by Beyer [R...
详细信息
We study two classical connectivity-preserving parallel shrinking algorithms proposed to recognize and label two-dimensional connected components of binary images. the algorithms we consider were developed by Beyer [Recognition of topological invariants by iterative arrays, Ph.D. thesis, MIT, 1969, p. 144] and Levialdi [Commun. ACM 15 (1) (1972) 7] independently for the purpose of shrinking 4-connected and 8-connected components of binary images in linear time, respectively. It is shown that those two independently developed algorithms are closely related and in a sense they are in a dual relation such that, for any initially given binary image and its inverted one, one algorithm produces, simultaneously, an image which is dual of the one produced by the other, step-by-step. (C) 2002 Elsevier Science B.V. All rights reserved.
We present first results from a comparison between a Fuzzy Classifier System operating at the level of whole rule-bases, and three variants of one that operates at the level of individual rules. the application domain...
详细信息
parallel computing technology is an efficient method for image compression because the encoding/decoding needs fast processing. Vector quantization is a hopeful image compression method and very suitable for paralleli...
详细信息
ISBN:
(纸本)8528500500
parallel computing technology is an efficient method for image compression because the encoding/decoding needs fast processing. Vector quantization is a hopeful image compression method and very suitable for parallelism. A new parallel architecture is presented for encoding of vector quantization. the new parallel architecture can deduct communication latency obviously but increase the cost of hardware very little.
In the plasmas used in semiconductor fabrication, collisions between electrons and polyatomic molecules produce reactive fragments that drive etching and other processes at the wafer surface.E xtensive and reliable da...
详细信息
this paper presents a programmable multiprocessor architecture suitable for image pre-processing in embedded vision systems. the architecture is made up of sixteen 16-bit input/32-bit output parallelprocessing elemen...
详细信息
We study two classical connectivity-preserving parallel shrinking algorithms proposed to recognize and label two-dimensional connected components of binary images. the algorithms we consider were developed by Beyer [R...
详细信息
We study two classical connectivity-preserving parallel shrinking algorithms proposed to recognize and label two-dimensional connected components of binary images. the algorithms we consider were developed by Beyer [Recognition of topological invariants by iterative arrays, Ph.D. thesis, MIT, 1969, p. 144] and Levialdi [Commun. ACM 15 (1) (1972) 7] independently for the purpose of shrinking 4-connected and 8-connected components of binary images in linear time, respectively. It is shown that those two independently developed algorithms are closely related and in a sense they are in a dual relation such that, for any initially given binary image and its inverted one, one algorithm produces, simultaneously, an image which is dual of the one produced by the other, step-by-step. (C) 2002 Elsevier Science B.V. All rights reserved.
暂无评论