Proceedings of the 1993 International Conference on Parallel ProcessingCRC Press, 1993. gada 16. aug. - 336 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 their complete computer reference library. |
No grāmatas satura
6.–10. rezultāts no 66.
28. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
34. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
41. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
46. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
47. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Using SyntheticPerturbation Techniques for Tuning Shared Memory Programs Extended | 2 |
FunctionParallel Computation in a DataParallel Environment II21 | 21 |
Automating Parallelization of Regular Computations for DistributedMemory | 30 |
MetaState Conversion II47 | 47 |
A Unified Model for Concurrent Debugging II58 | 58 |
PARSA A Parallel Program Scheduling and Assessment Environment II68 | 72 |
Decremental Scattering for Data Transport Between Host and Hypercube Nodes II82 | 82 |
Iteration Partitioning for Resolving Stride Conflicts on CacheCoherent | 95 |
SIMDDATA PARALLEL II166 | 166 |
An Adaptive Submesh Allocation Strategy For TwoDimensional Mesh Connected | 193 |
A Fair Fast Scalable ReaderWriter Lock II201 | 201 |
A Concurrent Dynamic Task Graph II223 | 223 |
Unified Static Scheduling on Various Models II231 | 231 |
Increasing Instructionlevel Parallelism through Multiway Branching II241 | 241 |
A Model for Automatic Data Partitioning II251 | 251 |
MultiLevel Communication Structure for Hierarchical Grain Aggregation II260 | 260 |
Compiling for Hierarchical Shared Memory Multiprocessors II107 | 107 |
Trailblazing A Hierarchical Approach to Percolation Scheduling II120 | 120 |
A Task Allocation Algorithm in a Multiprocessor RealTime System II130 | 130 |
Locality and Loop Scheduling on NUMA Multiprocessors II140 | 140 |
CompileTime Characterization of Recurrent Patterns in Irregular Computations II148 | 148 |
Investigating Properties of Code Transformations II156 | 156 |
Automatically Mapping Sequential Objects to Concurrent Objects The Mutual | 269 |
MISCELLANEOUS II278 | 278 |
On Compiling Array Expressions for Efficient Execution on DistributedMemory | 301 |
Bodhisattwa Mukherjee and Karsten Schwan | |
Citi izdevumi - Skatīt visu
Proceedings of the 1993 International Conference on Parallel Processing Alok N. Choudhary,P. Bruce Berra Priekšskatījums nav pieejams - 1993 |
Bieži izmantoti vārdi un frāzes
ADADs affinity region aggregation decisions alignment allocation analysis application architecture array elements assigned auxiliary free list benchmark block cache cache coherence cessor communication compiler concurrent conditional cost covering radius data dependence data distribution data-parallel dataflow dimension disk array dynamic efficient example fgrep Figure Fortran function global graph hash table hypercube IEEE implementation instruction iteration space latency linear load balancing lock loop fusion loop nests loop transformations machine MasPar matrix mesh method metrics MIMD multiprocessor node number of processors operations optimal overhead paper Parallel and Distributed parallel computers parallel execution parallel programs partitioning performance pointer problem Proc rate-optimal RISC scalar scheduling algorithm sequential shared memory SIMD simulation specification speedup statement static schedule strategy subcube submesh superscalar synchronization task technique Theorem tion total number transformations tree tuple unfolding factor vector VLIW