The papers submitted to the Tenth annualacmsymposium on parallelalgorithms and architectures are presented. The issues considered include network protocols, parallelalgorithms, multiprocessing systems, parallel pr...
详细信息
The papers submitted to the Tenth annualacmsymposium on parallelalgorithms and architectures are presented. The issues considered include network protocols, parallelalgorithms, multiprocessing systems, parallel processing systems, distributed computer systems, program compilers, sorting, computer science, data storage equipment, video signal processing.
The proceedings contains 39 papers from the 8th annualacmsymposium on parallelalgorithms and architectures. Topics discussed include: parallel random access memory;optical parallel process;release consistency;scope...
详细信息
The proceedings contains 39 papers from the 8th annualacmsymposium on parallelalgorithms and architectures. Topics discussed include: parallel random access memory;optical parallel process;release consistency;scope consistency;entry consistency;cache coherence protocol;thread management;weight factoring;rooted tree networks;butterfly networks;memory mapping;network routing table;all to all personalized communication;sample sort;radix sort;blockwise sample;minimum spanning forests;and virtual channels.
The proceedings contains 32 papers from the 9th annualacmsymposium on parallelalgorithms and architectures. Topics discussed include: Cilk programs;parallel scheduling algorithms;reactive diffracting trees;load bal...
详细信息
The proceedings contains 32 papers from the 9th annualacmsymposium on parallelalgorithms and architectures. Topics discussed include: Cilk programs;parallel scheduling algorithms;reactive diffracting trees;load balancing and data remapping for adaptive grid calculations;spectral partitioners;three-dimensional pattern matching;matrix-factorization algorithms;shared-memory models;fault-prone Bulk-Synchronous parallel (BSP) machines;parallel bandwidth;external memory algorithms;system area network mapping;multi-class routing algorithms;interconnection networks;deadlock-free oblivious wormhole routing algorithms;all-optical networks;approximation algorithms;fine-grain multithreading;speculative retirement and instruction windows.
This conference proceeding contains 45 papers. The topics covered include: routing algorithms;array processing;message passing;fault tolerance;hypercubes;scheduling;parallelalgorithms;memory sharing;computational com...
详细信息
ISBN:
(纸本)0897913701
This conference proceeding contains 45 papers. The topics covered include: routing algorithms;array processing;message passing;fault tolerance;hypercubes;scheduling;parallelalgorithms;memory sharing;computational complexity;PRAMs;graph theory and data structures.
The proceedings contain 33 papers. The topics discussed include: a comparison of sorting algorithms for the connection machine CM-2;randomized sorting and selection on mesh-connected processor arrays;large-scale sorti...
ISBN:
(纸本)0897914384
The proceedings contain 33 papers. The topics discussed include: a comparison of sorting algorithms for the connection machine CM-2;randomized sorting and selection on mesh-connected processor arrays;large-scale sorting in parallel memories;optimal speedup for backtrack search on a butterfly network;fast and reliable parallel hashing;tight bounds for the chaining problem;parallel construction of trees with optimal weighted path length;more time-work tradeoffs for parallel graph algorithms;an overview of supertoroidal networks;and architectural primitives for a scalable shared memory multiprocessor.
The proceedings contain 47 papers. The topics discussed include: Fault-Tolerant Meshes with Small Degree;the verification of cache coherence protocols;fault diagnosis in a small constant number of parallel testing rou...
ISBN:
(纸本)0897915992
The proceedings contain 47 papers. The topics discussed include: Fault-Tolerant Meshes with Small Degree;the verification of cache coherence protocols;fault diagnosis in a small constant number of parallel testing rounds;tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults;on Gazit and Miller�s parallel algorithm for planar separators: achieving greater efficiency through random sampling;parallel and output sensitive algorithms for combinatorial and linear algebra problems;efficient parallel shortest-paths in digraphs with a separator decomposition;components for computing and communications;highly efficient dictionary matching in parallel;optimal parallel two dimensional pattern matching;and parallel construction and query of suffix trees for two-dimensional matrices.
The proceedings contain 45 papers. The topics discussed include: fast parallelalgorithms for the unit cost editing distance between trees;towards understanding exclusive read;on the parallel complexity of integer pro...
ISBN:
(纸本)089791323X
The proceedings contain 45 papers. The topics discussed include: fast parallelalgorithms for the unit cost editing distance between trees;towards understanding exclusive read;on the parallel complexity of integer programming;parallel RAMs with bounded memory wordsize;load balancing, selection and sorting on the hypercube;the power of parallel pointer manipulation;the communication complexity of several problems in matrix compntation;embedding of d-dimensional grids into optimal hypercubes;deterministic P-RAM simulation with constant redundancy;processor networks and interconnection networks without long wires;a lower bound on the size of shellsort sorting networks;cost-bandwidth tradeoffs for communication networks;a more practical PRAM model;the APRAM: incorporating asynchrony into the PRAM model;fault tolerance in hypercube-derivative networks;square meshes are not always optimal;parallel graph contraction;and the virtual time machine.
The proceedings contain 38 papers. The topics discussed include: efficient compilation of high-level data parallelalgorithms;improved abstract parity-declustered layouts for disk arrays;experiences with parallel n-bo...
ISBN:
(纸本)0897916719
The proceedings contain 38 papers. The topics discussed include: efficient compilation of high-level data parallelalgorithms;improved abstract parity-declustered layouts for disk arrays;experiences with parallel n-body simulation;a comparison of parallelalgorithms for connected components;studying overheads in massively parallel min/max-tree evaluation;scheduling trees using FIFO queues: a control-memory tradeoff;SIMD instruction cache;dynamic parallel tree contraction;improved bounds for routing and sorting on multi-dimensional meshes;parallel sorting by overpartitioning;an optimal randomized logarithmic time connectivity algorithm for the EREW PRAM;list ranking and list scan on the CRAY C-90;modeling communication in parallelalgorithms: a fruitful interaction between theory and systems?;on testing cache-coherent shared memories;diffracting trees;programming abstract DEC-alpha based multiprocessors the easy way;scheduling parallelizable tasks to minimize average response time;and an analysis of diffusive load-balancing.
Speculative data-parallelalgorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministic (NFA), often derived from regular e...
详细信息
暂无评论