Storage requirement estimation for data intensive applications with partially fixed execution ordering

In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partly fixed. At that stage, none of the existing estimation tools are adequate, as they either assume a fully specified execution order or ignore it completely. Using a representative application demonstrator, we show how our technique can effectively guide the designer to achieve a transformed specification with low storage requirement.

• Type: Conference
• Year: 2000
• Where: CODES
• Authors: Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. Aas
• Keywords: CODES 2000, Data Transfer Ordering, Low Storage Requirement, Software Engineering, Storage Requirement Estimation