Premium
Comparative timings of three different set implementations in occam
Author(s) -
Wilson G. A.,
Wilson G. A.
Publication year - 1989
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380190306
Subject(s) - occam , implementation , computer science , byte , set (abstract data type) , code (set theory) , programming language , parallel computing , occam's razor , struct , theoretical computer science , mathematics , statistics
Three different occam implementations of a Set datatype have been investigated, using arrays of bits, booleans (bytes) and full integers, and the performance of each compared. Execution times and code/data requirements are recorded, and surprisingly the best implementation is not as originally expected.