Well-behaved applications allow for more efficient scheduling

Current trends in embedded applications aim towards implementations with sets of inter-operating tasks and elaborate scheduling schemes. The quest for flexibility and universal applicability results in higher resource demands and reduced predictability. If the functional and connection problems are handled separately with the aid of appropriate tools, subsequent code generators can convert design specific issues, such as parallel structures in the functional part and the various periodicities in the connection part to linear and deterministic pieces of code. Such implementations do away with complicated run-time scheduling, make better use of the available resources and can be analyzed exhaustively before installation on a target. Copyright (C) 1999 IFAC.