Concurrent algorithms for real-time memory management

Ford, Ray

doi:10.1109/52.7940

Cited by 16 publications

(5 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate our algorithms, we used a suite of Ada programs, mostly drawn from the literature, that we had previously collected for testing FLAVERS. These included the Chiron user interface development system [8], several variants on the dining philosophers problem, a simulation of a gas station [10], a memory management system [7], and some communications protocols [19]. Many of these problems are arbitrarily scalable by adding instances of existing tasks.…”

Section: Resultsmentioning

confidence: 99%

The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification

Cobleigh

Clarke

Ostenveil

Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001

View full text Add to dashboard Cite

Finite state verification is emerging as an important technology for proving properties about software. In our experience, we have found that analysts have different expectations at different times. When an analyst is in an exploratory mode, initially formulating and verifying properties, analyses usually find inconsistencies because of flaws in the properties or in the software artifacts being analyzed. Once an inconsistency is found, the analyst begins to operate in a fault finding mode, during which meaningful counter example traces are needed to help determine the cause of the inconsistency. Eventually systems become relatively stable, but still require re-verification as evolution occurs. During such periods, the analyst is operating in a maintenance mode and would expect re-verification to usually report consistent results. Although it could be that one algorithm suits all three of these modes of use, the hypothesis explored here is that each would be best served by an algorithm optimized for the expectations of the analyst.

show abstract

Section: Resultsmentioning

confidence: 99%

The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification

Cobleigh

Clarke

Ostenveil

Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001

View full text Add to dashboard Cite

show abstract

“…We ran our ∆-observer-DFA implementation, as well as the push and pull versions, on a number of standard concurrent Ada examples, including different sizes of gas station [12], Milner's cyclic scheduler [21], memory management [9], token ring simulation [5], and Chiron [15] examples, as well as well-known readers-writers, dining philosophers and relay examples. In total, we ran 208 experiments (some of them use different sizes of the same scalable program and others check different properties for the same program).…”

Section: Comparison Of Flavers Analysis Implementationsmentioning

confidence: 99%

Using the observer design pattern for implementation of data flow analyses

Naumovich¹

2002

Proceedings of the 2002 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

View full text Add to dashboard Cite

Data flow analysis is used widely in program compilation, understanding, design, and analysis tools. In data flow analysis, problemspecific information is associated with nodes and/or edges in the flow graph representation of a program or component and re-computed iteratively. A popular data flow analysis design relies on a worklist that stores all nodes and edges whose data flow information has to be re-computed. While this approach is straightforward, it has some drawbacks. First, the presence of the worklist makes data flow algorithms centralized, which may reduce effectiveness of parallel implementations of these algorithms. Second, the worklist approach is difficult to implement in a way that minimizes the amount of information passed between flow graph nodes.In this paper, we propose to use the well-known Observer pattern for implementation of data flow analyses. We argue that such implementations are more object-oriented in nature, as well as less centralized, than worklist-based ones. We argue that by adopting this Observer-based view, data flow analyses that minimize the amount of information passed between flow graph nodes can be implemented easier than by using the worklist view. We present experimental data indicating that for some types of data flow problems, even single-threaded implementations of Observer-based data flow analysis have better run times than comparable worklist-based implementations.

show abstract

“…As shown in Figure 1, these two parts are closely coupled (Ford 1988). Using an analogy, a real-time system may be compared to a dancing couple, where the two partners have to react to each other's movements, and both have to take into account a time schedule i.e., the music rhythm.…”

Section: Introductionmentioning

confidence: 99%

Forecasting real-Time behavior during software design using a CASE environment

Lauber

1989

Real-Time Syst

View full text Add to dashboard Cite

Abstract. Real-time software is required to react within certain time constraints. Aimed at forecasting early during the design process whether the design approach chosen will fulfill those time constraints, while avoiding costly prototyping, two different methods have been developed: open-loop dynamic evaluation of time-critical parts of executable design specifications, and animating a closed-loop system, consisting of the executable design specifications, coupled to a dynamic simulation model of the physical system involved. Both methods are explained using examples.

show abstract

Concurrent algorithms for real-time memory management

Cited by 16 publications

References 2 publications

The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification

The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification

Using the observer design pattern for implementation of data flow analyses

Forecasting real-Time behavior during software design using a CASE environment

Contact Info

Product

Resources

About