In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarante...
Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Pe...
A scheduling scheme for MIMO systems which has the capability of obtaining multiuser diversity gain and controlling the link connection ratio among users simultaneously is proposed...
Jiwon Kang, Hakju Lee, Chungyong Lee, Young Yong K...
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
With the increased use of network enabled applications and server hosted software systems, scalability with respect to network connectivity is becoming an increasingly important s...