Proceedings of the 1995 International Conference on Parallel Processing: August 14 - 18, 1995, 3. sējumsThis set of technical books contains all the information presented at the 1995 International Conference on Parallel Processing. This conference, held August 14 - 18, featured over 100 lectures from more than 300 contributors, and included three panel sessions and three keynote addresses. The international authorship includes experts from around the globe, from Texas to Tokyo, from Leiden to London. Compiled by faculty at the University of Illinois and sponsored by Penn State University, these Proceedings are a comprehensive look at all that's new in the field of parallel processing. |
No grāmatas satura
1.5. rezultāts no 45.
v. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
xv. lappuse
... D. Quammen , and P. Y. Wang ( R ) : Data - Parallel Primitives for Spatial Operations E. G. Hoel and H. Samet ( R ) : A Parabolic Load Balancing Method A. Heirich and S. Taylor Session 9C : Partitioning and Scheduling Chair : Prof.
... D. Quammen , and P. Y. Wang ( R ) : Data - Parallel Primitives for Spatial Operations E. G. Hoel and H. Samet ( R ) : A Parabolic Load Balancing Method A. Heirich and S. Taylor Session 9C : Partitioning and Scheduling Chair : Prof.
2. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
6. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
9. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Saturs
Control Applications | 76 |
Graph Algorithms | 97 |
Algorithms on Networks I | 123 |
Nonnumerical Algorithms | 151 |
Algorithms on Networks II | 176 |
Partitioning and Scheduling | 203 |
Preface iii | |
Bieži izmantoti vārdi un frāzes
achieved algorithm alignment allowed applications approach architecture array assigned assume better block bounding broadcast called column communication complete component computation connected considered consists contains Control corresponding cycle data structure defined depends described determine distributed edges efficient elements example exchange execution factorization Figure given graph graph partitioning hypercube IEEE implementation increases initial input iteration label load matching matrix memory mesh method multiple neighbors node Note obtained operations optimal pair parallel partition path performance phase points possible Preference presented problem processors random reduce relations respectively routing rule scheme selected sequence sequential shown simulation single sorting speedup split stage step structure switching Table takes techniques tion tree University values vertex vertices
Bibliogrāfiskā informācija
| Nosaukums | Proceedings of the 1995 International Conference on Parallel Processing: August 14 - 18, 1995, 3. sējums |
| Autors | Kyle Gallivan |
| Izdevums: | ilustrēts |
| Izdevējs | CRC Press, 1995 |
| ISBN | 0849326176, 9780849326172 |
| Apjoms | 256 lappuses |
| Eksportēt avotu | BiBTeX EndNote RefMan |