Scalable Software Libraries

1 Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and represents a unique combination of features (e.g. concurrency, data structure, memory allocation algorithms) that distinguishes it from other components. We argue that this way of building data structure component libraries is inherently unscalable. Libraries should not enumerate complex components with numerous features; rather, libraries should take a minimalist approach: they should provide only primitive building blocks and be accompanied by generators that can combine these blocks to yield complex custom data structures. In this paper, we describe a prototype data structure generator and the building blocks that populate its library. We also present preliminary experimental results which suggest that this approach does not compromise programmer productivity nor the run-time performance of generated data s...

• Type: Conference
• Year: 1993
• Where: SIGSOFT
• Authors: Don S. Batory, Vivek Singhal, Marty Sirkin, Jeff Thomas
• Keywords: Building Blocks, Data Structures, Libraries, SIGSOFT 1993, Software Engineering