Kim Gostelow
- Gostelow, K. P., Flow of Control, Resource Allocation, and the Proper Termination of Programs, Ph.D. Dissertation and Computer Science Department Technical Report No. ULCA-ENG-7179, University of California, Los Angeles, California, December 1971. (UCLA-10P14--106). Google Scholar
Digital Library
- Berge, C., Theory of Graphs, Barnes and Noble (Eds.), Methuen and Co., 1962.Google Scholar
- Holt, A., Final Report for the Information System Theory Project, prepared for RADC, Contract No. AF30(602)--4211 by Applied Data Research, Inc., Princeton, 1968.Google Scholar
- Karp, R. M. and Miller, R. E., "Parallel Program Schemata," Journal of Computer and System Sciences, 3, 147--195, 1969.Google ScholarDigital Library
- Slutz, D. E., The Flow-Graph Schemata Model of Parallel Computation, MIT, Project MAC, Ph.D. Dissertation, MAC-TR-53 (thesis), 1968.Google Scholar
- Lampson, B. W., "A Scheduling Philosophy for Multiprocessing Systems," Communications of the ACM, 11, 347--360, 1968. Google ScholarDigital Library
- Dijkstra, E. W., "Cooperating Sequential Processes," Programming Languages, F. Genuys (Ed.), pp. 43--112, 1968, Academic Press, New York.Google Scholar
- Cerf, V., Fernandez, E., Gostelow, K. and Volansky, S., Formal Control-Flow Properties of a Model of Computation, Computer Science Department Technical Report No. UCLA-ENG-7178, University of California, Los Angeles, California, December 1971. (UCLA-10P14--105).Google Scholar
- Holt, Richard, On Deadlock in Computer Systems, Technical Report CSRG-6, University of Toronto, (Ph.D. Dissertation from Cornell University), April 1971. Google ScholarDigital Library
- Cerf, V., Multiprocessors, Semaphores and a Graph Model of Computation, Computer Science Department Technical Report No. 7223, University of California, Los Angeles, California, April 1972. (UCLA-10P14--110).Google Scholar
Recommendations
Proper termination of flow-of-control in programs involving concurrent processes
ACM '72: Proceedings of the ACM annual conference - Volume 2This paper presents new results from a study of flow-of-control in programs involving concurrent processes. Within the framework of flow-of-control, this paper:
1) defines a property of parallel program behavior called proper termination (PT);
2) shows ...
Distributed termination of concurrent processes in Occam
A typical tissue in concurrent programming is to ensure the correct distributed termination of processes which compose a concurrent program. A concurrent program is terminated when every process is passive and there are no messages in transit. The Oceam ...
Execution privatization for scheduler-oblivious concurrent programs
OOPSLA '12Making multithreaded execution less non-deterministic is a promising solution to address the difficulty of concurrent programming plagued by the non-deterministic thread scheduling. In fact, a vast category of concurrent programs are scheduler-oblivious:...
Comments