A fine-grained highly parallel program has many threads of execution. the first task to debug it is comprehending the situation of the execution. For this task, it is important to visualize the execution. Our debugger...
详细信息
parallel graph reduction is a model for parallel program execution in which shared-memory is used under a strict access regime with single assignment and blocking reads. We outline the design of an efficient and accur...
详细信息
A lot of programming models have been proposed to deal withparallelism in order to express program transformations and refinements. this justifies to introduce an unifying theory to abstract different concepts. the a...
详细信息
this paper presents two techniques enabling the trace-driven simulation of a single cache memory to be performed in parallel. they are both based on splitting the trace into sub-traces which are then separately applie...
详细信息
this paper describes a new load balancing algorithm, the probabilistic strategy with neighbourhood synchronization (PNS), for massively parallel computers. the proposed strategy differs from fully distributed approach...
详细信息
the proceedings contain 27 papers. the special focus in this conference is on Foundations of Data Organization and algorithms. the topics include: Storage system architectures for continuous media data;physical storag...
ISBN:
(纸本)9783540573012
the proceedings contain 27 papers. the special focus in this conference is on Foundations of Data Organization and algorithms. the topics include: Storage system architectures for continuous media data;physical storage organizations for time-dependent multimedia data;user interface management system embedded in a multimedia document editor framework;management of physical replicas in parallel multimedia information systems;efficient similarity search in sequence databases;filtered hashing;design and implementation of DDH: a distributed dynamic hashing algorithm;performance analysis of superimposing-coded signature files;trie methods for representing text;estimation of false drops in set-valued object retrieval with signature files;data structure and algorithms for new hardware technology;evaluation of upper bounds and least nodes as database operations;a system for data sharing among heterogeneous object models;dynamic selectivity estimation for multidimensional queries;reducing page thrashing in recursive query processing;the sybase replication server project;analogical inferred compensation method for heterogeneous database schema mismatch and its application to hypermedia cooperative work system;a survey of DBMS research issues in supporting very large tables;a survey of DBMS research issues in supporting very large tables;an algorithm for the implementation of replicated tables;improved traditional mirror;adaptive load balancing in disk arrays;challenges to the database community;an object-oriented office space description model and an office view management mechanism for distributed office environment and stamp locking method for multiversion composite objects.
Two O(log/sup 2/ n) time algorithms are proposed for computing the dominators and constructing the dominator tree of a directed acyclic graph, G=(V, E), |V|=n, |E|=m. the parallel computation used is a practical SIMD ...
详细信息
Two O(log/sup 2/ n) time algorithms are proposed for computing the dominators and constructing the dominator tree of a directed acyclic graph, G=(V, E), |V|=n, |E|=m. the parallel computation used is a practical SIMD hypercube multiprocessor with n/sup 3/ processing elements. the algorithms developed in this paper achieve the same time complexity as those developed on PRAM model (S. Pawagi, 1987), (C. Savage, 1977) but are more practical.< >
We derive a parallel solution to the problem of finding the longest increasing subsequence in a finite sequence of numbers. We first describe a sequential solution with time complexity O(n log n) and space complexity ...
详细信息
We derive a parallel solution to the problem of finding the longest increasing subsequence in a finite sequence of numbers. We first describe a sequential solution with time complexity O(n log n) and space complexity O(n). Secondly, we show how a parallel solution can be obtained using a partially pipelined linear modular systolic array, with time complexity O(n).< >
We develop an allocation algorithm that, in conjunction with optimal scheduling algorithms, yields the minimum time cost for a parallel structure. We assume a shared memory environment and a limited number of processo...
详细信息
We develop an allocation algorithm that, in conjunction with optimal scheduling algorithms, yields the minimum time cost for a parallel structure. We assume a shared memory environment and a limited number of processors that is less than the degree of parallelism of the parallel structure.< >
Data parallel programs on MIMD machines are often structured as alternating phases of local computation and global communication such as reduction, synchronization, broadcast, etc. this paper describes the performance...
详细信息
Data parallel programs on MIMD machines are often structured as alternating phases of local computation and global communication such as reduction, synchronization, broadcast, etc. this paper describes the performance comparison of data parallel operations on the CM-5 and Intel Touchstone Delta multiprocessors and models these primitives.< >
暂无评论