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 41.
21. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
31. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
33. 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..
35. 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
Nonnumerical Algorithms | 151 |
Algorithms on Networks II | 176 |
Partitioning and Scheduling | 203 |
Program Committee iv | |
Control Applications | |
Bieži izmantoti vārdi un frāzes
algorithm alignment allowed applications approach architecture array assigned assume balancing better block bounding broadcast called color 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 keys labels load matrix memory mesh method multiple neighbors node Note obtained operations optimal pair parallel partition path performance phase points possible presented problem processors random reduce refer relations respectively routing rule scheme selected sequence sequential shown simulation single solve sorting speedup split stage step structure Table takes techniques tion tree University values vertices