DocumentCode
2345584
Title
Parallel roadmaps: discrete to continuous
Author
Exman, Iaakov ; Citron, Daniel
Author_Institution
Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
fYear
1994
fDate
4-7 Oct 1994
Firstpage
186
Lastpage
188
Abstract
Parallel Roadmaps are apparently naive visual constructs, which remain intelligible and provide invaluable debugging clues as program complexity increases. With a few activities, roadmaps are discrete and detailed. With large numbers of them, continuous regions are formed by coalescing of adjacent activities. The main thesis of this paper is that a smooth transition from discrete to continuous maps, without changing the basic graphical entities, is an effective means to deal with parallelism at largely different scales
Keywords
parallel programming; program debugging; visual languages; visual programming; Parallel Roadmaps; debugging; debugging clues; large-scale parallelism; monitoring; naive visual constructs; program complexity; program visualization; visual constructs; Binary trees; Computer science; Data mining; Debugging; Large-scale systems; Monitoring; Parallel processing; Resumes; Shape; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Visual Languages, 1994. Proceedings., IEEE Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-6660-9
Type
conf
DOI
10.1109/VL.1994.363619
Filename
363619
Link To Document