M.H. Brown. Exploring algorithms using Balsa-II. Computer, 21(5):14--36, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....animation library. 10 While BALSA is recognised as a landmark system in algorithm animation and as an important pedagogic tool, it has a number of drawbacks. Firstly, it is very programmer intensive. Secondly, the algorithm being evaluated is affected by integration with the BALSA system. [11] Zeus The first system to use colour and sound to impart information was the Zeus algorithm animation system. Zeus can also animate parallel as well as sequential algorithms. Some of the techniques incorporated into Zeus are important to the area of visualisation in general: 1) multiple views are ....

Brown, M.H., Exploring algorithms using BALSA-II. IEEE Computer, 1988. 21(5): p. 14-36. 65

....this section we will briefly review some software visualization tools. For more in depth information we refer the reader to one of the many available visualization taxonomy studies [22,23,26,27] 5. 1 Static Visualization One of the best known interactive software visualization systems is BALSA [4] developed at Brown University. BALSA annotates the program being visualized with hooks so that interesting events such as changes to data structures and subroutine calls and returnss can be relayed to the visualization system. This in turn builds up a view that corresponds to these events. ....

M. Brown. Exploring algorithms using Balsa-II. IEEE Computer, 21(5):14--36, 1988.

....[2] Since creating good animations can be a difficult and time consuming task, researchers started thinking about ways to automate the process of animating a program, or at least to make it easier. The first such system, Balsa by Brown and Sedgewick [7] was soon followed by others like Balsa II [4], Zeus [5] Tango [35] UWPI [19] Pavane [33] Catai [9] Jeliot [24] Vega [20] Leonardo [10] or Wave [12] just to mention some of the more important ones. We will not describe these systems here in detail, that has been done in an excellent way in other surveys by Price et al. 30] and ....

M. H. Brown. Exploring algorithms using Balsa-II. Computer, 21(5):14--36, 1988.

.... or OS monitors that provide access to process execution states, and the situation may be even worse in networked environments [21] A di#erent approach hinges upon program instrumentation, i.e. on augmenting the source object executable code to emit events that contain monitoring information [2, 3, 14, 23]. Instrumenting source code has the advantage of referring to variable names more directly and treating data more semantically , but typically requires implementing an auxiliary parser or compiler. Moreover, not all platforms provide high level primitives for accessing every aspect of the ....

M.H. Brown. Exploring algorithms using Balsa-II. Computer, 21(5):14--36, 1988.

....comprehensibility, clearness) of a visualization counts much for the user who is to ob serve projections. It is mostly influenced by two factors. The frst is the repertoire of graphical representations offered by the systera In WinSanal it is not as reach as in the best known AVSs such as Balsa [6, 7], Zeus [8] or in XTango [9] However, in practice only a limited subset of representations has been used in visualizations [10] WinSanal s repertoire is close to that subset. The second factor is the possibility of creating projections at a high level of abstraction [2, 11 ] Such projections ....

....be shown. In WinS anal an extensive subsystem of data transformations establishes a general tool for obtaining highly abstract visualizations. A good example is presentation of discrete changes of data in the form of smooth transitions. Balsa I [6] did not own this feature. It appeared in Balsa II [7] and later systems. Actually it became a part of a de facto standard. The ease of adapting programs for projections under an AVS is affected by another two factors. The frst of them is system assistance in the visualizer s activities. In WinSanal this category of programmer s aids is currently ....

M.H. Brown, Exploring algorithms using Balsa II, Computer, 21(5) 1988, 14-36.

....one per invocation) are all examples of direct representation. The most common form of direct representation is the mapping of the values of variables to the attributes of graphical objects. Brown, for example, uses such a direct mapping in two visualizations of sorting algorithms using BALSA [2]. In both cases the array that is being sorted is represented in the image by a collection of objects. The index of each array element is mapped to the object s X coordinate, while the value of the element maps to either the object s Y coordinate (Brown s Dots view ) or its Y size ( Sticks ....

Brown, M. H., "Exploring Algorithms using Balsa-II," IEEE Computer, vol. 21, no. 5, pp. 14-36, 1988.

....development as a main way of expressing and simplifying the complexity of software systems. Graphical notations have been proposed for almost all phases of the development, from requirement analysis, for example Extended Petri Nets [20] to program execution animation, for example Balsa II [21]. What makes a a graphical representation really useful is its analytical and consistency characteristics [1] In terms of a graphical notation that represents the behavioural aspects of a process, the notation should permit analysis of the behavioural properties of the process. The most ....

G.P. Brown. Exploring algorithms using Balsa-II. IEEE Computer, 21(4):14--36, May 1988.

....argued previously [6] program visualization may be viewed as a mapping from some aspect of the program (code, data or control state, or execution behavior) to a graphical representation. This declarative treatment of visualization is used indirectly by such traditional systems as Balsa and Zeus [1,2], where program events are mapped to operations on an image. Other systems, such as Aladdin [4] Tango [9] and our own Pavane [7] are more explicit in their modeling of visualization as a mapping. The mappings used in program visualization range from simple direct associations between the values ....

Brown, M. H., Exploring Algorithms using Balsa-II, IEEE Computer, vol. 21, no. 5, pp. 14-36, 1988.

....interactions. Program visualization, the animated display of various aspects of algorithm execution, has been utilized in an attempt to provide appropriate analysis tools [27, 32] In particular, program visualization has been applied to such diverse applications as computer science instruction [9], visual debugging [21] program verification and reasoning [27] and educational software [16] Typical visual environments use pictorial abstractions to represent program components and their interactions, showing the various stages of a program in execution. Note that a visualbased analysis ....

....execution. Although we are concerned with visualizing parallel and distributed programs, it is still useful to contrast and compare with these sequential systems in order to reveal differences in expressiveness and specification techniques. Representative sequential environments include BALSA [9] and its descendent ZEUS [10] and TANGO [31] Technically, these environments are not restricted to visualizing sequential programs. However, none of the named systems includes explicit mechanisms for dealing with concurrency. The strength of these systems tends to lie not in their visualization ....

M. H. Brown. Exploring algorithms using balsa-ii. IEEE Computer, May 1988.

....is sensitive to the ordering of variables. Animating the computation of such algorithms could indicate heuristics for deducing a good ordering from a given input. The common approach to animating algorithms specified in high level procedural languages was pioneered in BALSA in the early 1980 s ([Bro88]) System such as BALSA were constrained by a lack of computational power for real time two dimensional graphics. In the mid 1980 s, systems like Animus ( Dui86] used smooth transformations of 2D images to animate small examples. TANGO in the late 1980 s ( Sta90] and then XTANGO provide an ....

Mark H. Brown. Exploring algorithms using BALSA-II. IEEE computer, 21(5):14--36, 1988.

....the program speed and run the program backwards. The animation is actually achieved by calls to animation routines which the user has inserted in the source code at locations of interesting events. The user can also write his own animation routines in Pascal. The most recent version, BALSA II (Brown, 1988), supports colour and rudimentary sound. The SEE Program Visualizer (Baecker and Marcus, 1990) is a UNIX based system for typesetting programs written in C. This work combines human factors research with modern typography and laser printing technology to format C programs automatically and ....

Brown, M.H. (1988). Exploring Algorithms Using Balsa II.

....complex graphs, trees, or computational geometry abstractions. BALSA was able to display multiple algorithms running simultaneously as well as multiple views of the same data structure. The initial versions of BALSA ran in black and white on Apollo workstations. Browns subsequent version, BALSA II [Brown88], ran in color on Apple Macintosh personal computers and allowed rudimentary sounds to be associated with events. Figure 1 shows a still from an algorithm race in BALSA II. Figure 1: A still from Balsa II showing a race between two bin packing programs (first fit and first fit decreasing) 2.3.1.2 ....

Brown M.H., Exploring Algorithms using BALSA-II , IEEE Computer, Vol. 21(15), pp. 14-36, 1988

....manager of interesting events, like the entry into a function or the access of a particular data structure. The system was successfully used as a teaching aid in Computer Science classes at Brown for a number of years, until it was replaced by later versions. In 1988, Brown released Balsa II [4][5], which provided additional scripting facilities. In addition, it was in color and allowed the use of sound in addition to visual representations. 2.1.2 Zeus Zeus, also developed by Brown, is another descendant of BALSA [6] 7] Released as a prototype in 1991, Zeus provides the user of the ....

Brown, M. H. (1988b). "Exploring Algorithms Using Balsa II." IEEE Computer, 21(5): 14-36.

....model, the improvements can be modest at best, since only a log N= log log N gap remains between the upper and lower bounds. Experimental analysis: The design of new and the analysis of existing fault tolerant parallel algorithms can be aided by using experimentation. Algorithm animation [25, 95] has the promise of providing additional insights into algortihms behavior through visualization. A tool for animating Write All algorithms was developed by Apgar [9] using Stasko s TANGO system [95] Using the that animation, an observer can monitor the progress of a parallel computation and ....

M.H. Brown, "Exploring algorithms using Balsa-II", IEEE Computer, Vol.21, No.5, pp. 14-36, 1988.

No context found.

M.H. Brown. Exploring algorithms using Balsa-II. Computer, 21(5):14--36, 1988.

No context found.

M.H. Brown. Exploring Algorithms Using Balsa-II, IEEE Computer, Volume 21, Number 5, May 1988, pp. 14-36. Reprinted in [15].

No context found.

M. H. Brown, "Exploring Algorithms Using Balsa II". IEEE Computer, Vol. 21, N5, 1988, pp. 14-36.

No context found.

Marc H. Brown. Exploring algorithms using BALSA-II. IEEE Computer, 21(5):14--36, May 1988.

No context found.

M. H. Brown. Exploring Algorithms Using BalsaII. IEEE Computer. May 1988.

No context found.

M.H. Brown. Exploring algorithms using Balsa-II. Computer, 21(5):14--36, 1988.

No context found.

M. H. Brown, "Exploring algorithms using balsa-ii," IEEE Computer, vol. 21, no. 15, pp. 14--36, 1988.

No context found.

Brown, M. H. Exploring Algorithms using BALSA-II. IEEE Computer 21, 5 (May 1988), 1436.

No context found.

)Brown, M.H., "Exploring Algorithms using Balsa-II ", in IEEE Computer(21) 5 pp. 14-36 (1988)

No context found.

Brown, M. H. (1988b). Exploring Algorithms Using Balsa II. IEEE Computer, 21(5): 14 36.

No context found.

M. H. BROWN. Exploring Algorithms Using Balsa II. IEEE Computer, Vol. 21, N5, 1988, str. 14-36.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC