Abstract

Abstract-With the rise in complexity of modern systems, designers are spending a significant time on modeling at the system level of abstraction. This paper introduces Model Algebra, a formalism built on top of system level design languages, that can be used for implementing functionality preserving transformations on system level models. Such transformations enable us to implement high level design decisions without having to write new models for each design decision. Moreover, since these transformations preserve functionality, the transformed models do not need to be re-verified. We present the definition of Model Algebra and show how system level models can be represented as expressions in this formalism. The laws of Model Algebra are use to define correct model transformations. We show a system level design scenario, where design decisions gradually refine the functional model of the system to an architectural model with components and communication structure. The refinement can be performed using the correct model transformations in our formalism.

No abstract

In this paper we present a scheme for reducing the amount of synchronization overhead needed between components, after HW/SW partition-. ing, to preserve the original control flow of the specification. Since tra c between components is expensive, our scheme can significantly enhance the performance of the system implementation. Our'optimization technique dynamically groups the tasks in the specification such that synchronization for different tasks can be shared. The grouping depends on the partitioning decision, and hence, is performed during the generation of the partitioned model. We apply our grouping algorithm for various partitions on system level models of industry standard designs, The experimental results show significant reduction in synchronization overhead compared to the unoptimiaed model. 0-7803-8736-8/05/$20.00 02005 IEEE.