Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
: This paper explores the potential gain of joint diversity in both frequency domain and time domain which can be exploited to achieve spectral efficiency gains whilst simultaneous...
We present the results of our study of 15 working parents, and how they manage their life scheduling needs, that is, how they manage their personal and professional schedules acro...
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...