Robert L. Ashenhurst
Maurice V. Wilkes
Methods and approaches for testing the reliability and trustworthiness of software remain among the most controversial issues facing this age of high technology. The authors present some of the crucial questions faced by software …
David L. Parnas, A. John van Schouwen, Shu Po Kwan
Planning for recovery from a disaster is quickly becoming recognized as a necessity for higher education computing installations. This article presents a structural framework, describes the stages, and tells how to implement …
Renate Rohde, Jim Haskett
Exploring the strengths and weaknesses of three alternative bases for systems staff departmentalization suggests the benefits of an organizational form in which maintenance is separate from new system development.
E. Burton Swanson, Cynthia Mathis Beath
Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent …
Using only a few simple and commonplace instructions, this algorithm efficiently maps variable-length text strings small integers.
Peter K. Pearson
Extendible hashing is a dynamic data structure which accommodates expansion and contraction of any stored data efficiently. In this article, an algorithm has been developed for managing concurrent operations on extendible hashing …