00000cab a22000003a 4500 UP-99796217609624383 Buklod 20231007234425.0 m |o d | ta 110118s xx d | ||r ||||| || DENGII eng Pop, P. Scheduling and mapping in an incremental design methodology for distributed real-time embedded systems. pp. 793-811 In this paper, we present an approach to mapping and scheduling of distributed embedded systems for hard real-time applications, aiming at a minimization of the system modification cost. We consider an incremental design process that starts from an already existing system running a set of applications. We are interested in implementing new functionality such that the timing requirements are fulfilled and the following two requirements are also satisfied: 1) the already running applications are disturbed as little as possible and 2) there is a good chance that later, new functionality can easily be added to the resulted system. Thus, we propose a heuristic that finds the set of already running applications which have to be remapped and rescheduled at the same time with mapping and scheduling the new application, such that the disturbance on the running system (expressed as the total cost implied by the modifications) is minimized. Once this set of applications has been determined, we outline a mapping and scheduling algorithm aimed at fulfilling the requirements stated above. The approaches have been evaluated based on extensive experiments using a large number of generated benchmarks as well as a real-life example. Benchmarks. Distributed real-time embedded systems. Hard real-time applications. Incremental design methodology. Mapping algorithm. Scheduling algorithm. System modification cost minimization. IEEE Transactions on VLSI systems 12, 8 (2004). FO UPD DENG-II Article