Murray Cole
- 1.BATCHER, K. Sorting networks and their applications. In Proc. AF~PS Spring Joint Computer Conference (1968), pp. 307-314.Google Scholar
Digital Library
- 2.~3OTOROG, G., AND KUCHEN, H. Efficient parallel programming with algorithmic skeletons. In Proceedings of EuroPar '96 (1996), L. Bouge, P. Praigniaud, A. Mignotte, and Y. Robert, Eds., vol. 1123 of LNC$, Springer, pp. 718-731. Google ScholarDigital Library
- 3.COLE, M. Algorithmic Skeletons: Structured Management o} Parallel Computation. Pitman, 1989. Google ScholarDigital Library
- 4.COLE, M. On Dividing and Conquering Independently. In Lecture Notes in Computer Science 1300 (1997)7 pp. 634-637~ Google ScholarDigital Library
- 5.DARLINGTON, J., GUO, Y., To, H., AND YANG, J. Parallel Skeletons for Structured Composition. In Proceedings of A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming (1995), ACM Press, pp. 19-28. Google ScholarDigital Library
- 6.KuM^rt, V., GRAMA, A., GUPTA, A., AND KARYPIS, G. introduction to Parallel Computing. Benjamin Cummings, 1994.Google Scholar
- 7.PELAGATTI, S., AND DANEt, UTTO, M. Struetared De,etopment of Parallel Programs. Taylor & Francis, 1997. Google ScholarDigital Library
- 8.To, H. Optimisin9 the Parallel Behaviour of Combinations of Program Components. PhD thesis, Department of Computing, Imperial College, 1995.Google Scholar
Index Terms
- Activity graphs: a model-independent intermediate layer for skeletal coordination
Recommendations
Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons
A dependent edge in an acyclic orientation of a graph is one whose reversal creates a directed cycle. In answer to a question of Erdös, Fisher et al. [5] define dmin(G) to be the minimum number of dependent edges of a graph G, where the minimum is taken ...
Testcases Formation Using UML Activity Diagram
CSNT '13: Proceedings of the 2013 International Conference on Communication Systems and Network TechnologiesMost of the software practitioners believe in Model-based test case generation. Advantages of this are the early detection of faults, reducing software development time etc. The most important part of the testing attempt is the test case generation. As ...
Equimatchable Graphs on Surfaces
A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Comments