DocumentCode
1145147
Title
Recasting algorithms to encourage reuse
Author
Weide, Bruce W. ; Ogden, William F. ; Sitarama, Murali
Author_Institution
Ohio State Univ., Columbus, OH, USA
Volume
11
Issue
5
fYear
1994
Firstpage
80
Lastpage
88
Abstract
Instead of viewing algorithms as single large operations, the authors use a machine-oriented view to show how they can be viewed as collections of smaller objects and operations. Their approach promises more flexibility especially in making performance trade-offs, and encourages black-box reuse. They recommend black-box reuse because the real value of reused code lies in its properties, such as correctness with respect to an abstract specification. If you make even small structural or environmental changes, the confidence in these properties tends to evaporate, and with it most of the component´s value. They show how to design an entire category of more flexible black-box reusable software components by applying a general design technique that recasts algorithms as objects. To illustrate the technique, they recast a sorting algorithm and a spanning-forest algorithm into objects.<>
Keywords
object-oriented programming; software reusability; sorting; black-box reuse; graph algorithm; machine-oriented view; objects; performance trade-offs; recasting; sorting algorithm; spanning-forest algorithm; Algorithm design and analysis; Concrete; Data processing; Data structures; Software algorithms; Software performance; Software reusability; Sorting; Tree graphs; Wire;
fLanguage
English
Journal_Title
Software, IEEE
Publisher
ieee
ISSN
0740-7459
Type
jour
DOI
10.1109/52.311066
Filename
311066
Link To Document