this paper describes the parallelization of the low-rank ADI iteration for the solution of large-scale, sparse Lyapunov equations. the only relevant operations involved in the method are matrix-vector products and the...
详细信息
As the degree of instruction-level parallelism in superscalar architectures increases, the gap between processor and memory performance continues to grow requiring more aggressive techniques to increase the performanc...
详细信息
Query cost models are widely used, both for performance analysis and for comparing execution plans during query *** essence, a cost model predicts where time is being spent during query evaluation. Although many cost ...
详细信息
Databases are nowadays one more building block in complex multi-tier architectures. In general, however, they are still designed and optimized with little regard for the applications that will run on top of them. this...
详细信息
ISBN:
(数字)9783540458760
ISBN:
(纸本)3540433244
Databases are nowadays one more building block in complex multi-tier architectures. In general, however, they are still designed and optimized with little regard for the applications that will run on top of them. this problem is particularly acute in scientific applications where the data is usually processed at the client and, hence, conventional server side optimizations are of limited help. In this paper we present a variety of techniques and a novel client/server architecture designed to optimize the client side processing of scientific data. the main building block in our approach is to store frequently accessed data as relatively small, wavelet encoded segments. these segments can be processed at different qualities and resolutions, thereby enabling efficient processing of very large data volumes. Experimental results demonstrate that our approach significantly reduces overhead (I/O, transfer across network, decoding and analysis), does not require changes to the analysis routines and provides all possible resolution ranges.
In this paper we present SCALEA, which is a performance instrumentation, measurement, analysis, and visualization tool for parallel and distributed programs that supports post-mortem and online performance analysis. S...
详细信息
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.
the proposed approach consists in extending an existing sequential mesh generator in order to design a parallel mesh generator. A sequential three-dimensional mesh generator builds the internal mesh by applying advanc...
详细信息
Symbolic cost models are an important performance engineering tool because of their diagnostic value and their very low solution cost when the computation features regularity. However, especially for parallel applicat...
详细信息
the proceedings contain 55 papers. the special focus in this conference is on Developping Web Services, Object Databases, Component, Ontology and UML Modelling. the topics include: the latest development on cognitive ...
ISBN:
(纸本)3540440879
the proceedings contain 55 papers. the special focus in this conference is on Developping Web Services, Object Databases, Component, Ontology and UML Modelling. the topics include: the latest development on cognitive informatics;pluggable services for tailorable e-content delivery;an object-oriented approach for designing administrative e-forms and transactional e-services;trust objects in electronic commerce transactions;OODBMS metamodel supporting configuration management of large applications;generic applications for object-oriented databases;validated cost models for parallel OQL query processing;supporting web development in the open process;semantic integration of heterogeneous xml data sources;customization policies need more than rule objects;tool and a formalism to design and apply patterns;generating domain models from ontologies;a framework to review complex experimental knowledge;a framework to translate UML class generalization into java code;a UML variant for modeling system searchability;a methodological framework for understanding is adaptation through enterprise change;adapting analysis and design to software context;reflective analysis and design for adapting object run-time behavior;generation of object models for information systems from business system models;requirements capture workflow in global information systems;supporting development of enterprise javabeans through declarative meta programming;evaluating the DSMIO cache-coherence algorithm in cluster-based parallel ODBMS;a retrieval technique for software components using directed replaceability similarity;evaluating information systems development methods;active objects for coordination in distributed testing and a controlled experiment for validating class diagram structural complexity metrics.
the external selection problem is to select the record withthe K-th smallest key from the given N records that are distributed and stored evenly on the D disks for the parallel machine with D processors. Each process...
详细信息
ISBN:
(纸本)0769515126
the external selection problem is to select the record withthe K-th smallest key from the given N records that are distributed and stored evenly on the D disks for the parallel machine with D processors. Each processor has its own primary memory of size M records and one disk, where N/D>M. the processors are connected with a /spl radic/D /spl times/ /spl radic/D mesh architecture. Based on a two-stage approach, this paper presents an efficient parallel external selection algorithm for the distributed-memory parallel systems. First, all the processors execute local external sorting in parallel, each processor sorts the N/D records on its own disk. Next, they execute parallel external selection from the D sorted sub-files on the D disks. this algorithm is asymptotically optimal and has a small constant factor of time complexity.
暂无评论