Proceedings of the 1993 International Conference on Parallel ProcessingCRC Press, 1993. gada 16. aug. - 352 lappuses This three-volume work presents a compendium of current and seminal papers on parallel/distributed processing offered at the 22nd International Conference on Parallel Processing, held August 16-20, 1993 in Chicago, Illinois. Topics include processor architectures; mapping algorithms to parallel systems, performance evaluations; fault diagnosis, recovery, and tolerance; cube networks; portable software; synchronization; compilers; hypercube computing; and image processing and graphics. Computer professionals in parallel processing, distributed systems, and software engineering will find this book essential to complete their computer reference library. |
No grāmatas satura
1.–5. rezultāts no 77.
4. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
7. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
11. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
12. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
13. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
SpaceTime Representation of Iterative Algorithms and The Design of Regular Processor | 2 |
On the Parallel Diagonal Dominant Algorithm III10 | 10 |
Supernodal Sparse Cholesky Factorization on DistributedMemory Multiprocessors III18 | 18 |
Multiple Quadratic Forms A Case Study in the Design of Scalable Algorithms III37 | 37 |
DataParallel RTree Algorithms III47 | 47 |
Embedding Grids Hypercubes and Trees in Arrangement Graphs III65 | 65 |
On Embeddings of Rectangles into Optimal Squares III73 | 73 |
Pattern Recognition Using Fractals III82 | 82 |
Optimal Routing Algorithms for Generalized de Bruijn Digraphs III167 | 167 |
A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes III175 | 175 |
Generation of Long Sorted Runs on a Unidirectional Array III184 | 184 |
Time and VLSIOptimal Sorting on Meshes with Multiple Broadcasting III192 | 192 |
SnakeSort A Family of Simple Optimal Randomized Sorting Algorithms III201 | 201 |
On the BitLevel Complexity of Bitonic Sorting Networks III209 | 209 |
Multicoloring for Fast Sparse MatrixVector Multiplication in Solving | 215 |
Parallel Implementations of a Scalable Consistent Labeling Technique on Distributed | 227 |
Efficient Image Processing Algorithms on the Scan Line Array Processor III90 | 90 |
OnTime and Olog nSpace Image Component Labeling with Local Operators | 98 |
Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization III107 | 107 |
Scalability of Parallel Algorithms for Matrix Multiplication III115 | 115 |
Generalised Matrix Inversion by Successive Matrix Squaring III124 | 124 |
A FaultTolerant Parallel Algorithm for Iterative Solution of the Laplace Equation III133 | 133 |
Emulating Reconfigurable Arrays for Image Processing Using the MasPar Archi | 141 |
Ring Embedding in an Injured Hypercube III149 | 149 |
Fast Parallel Algorithms for Routing OneToOne Assignments in Benes Networks III159 | 159 |
RECONFIGURABLE ARCHITECTURE AND DATABASE APPLICATION III235 | 235 |
RESOURCE ALLOCATION AND FAULT TOLERANCE III262 | 262 |
Impact of Data Placement on Parallel IO Systems III276 | 276 |
Performance of a GloballyClocked Parallel Simulator III289 | 289 |
Fast Enumeration of Solutions for Data Dependence Analysis and Data Locality | 299 |
Square Meshes Are Not Optimal For Convex Hull Computation III307 | 307 |
Table of Contents Full Proceedings | A-1 |
Bieži izmantoti vārdi un frāzes
applied architecture array articulation point assigned assume binary Bitonic Sorting bits block bound broadcast cache misses column communication complexity connected coupled method denote dilation dimension disk distribution efficient elements embedding equation execution factor fan-in fault-free faulty Figure fractal function gorithm grid hash hypercube implementation input integer keys label Lemma linear load balancing loop machine mapping MasPar matrix matrix multiplication merge merge algorithm multiple multiprocessor neighbors next-run item node number of processors O(log operations optimal output overhead parallel algorithm Parallel Computing Parallel Processing partition path PDD algorithm performance permutation permutation graph phase pixel problem Proc R-tree radiosity reconfigurable mesh rithm routing algorithms scalability Section SIMD simulation sorting Sorting Network sparse matrix speedup stage step supernodal task technique Theorem tion total number transitive closure U₁ undirected graph update variables vector vertex