Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels

Share and Export

Vasudevan, Dinkar, Subramanian, Vijay G. and Leith, Douglas J. (2010) Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels. Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on . ISBN 978-1-4244-7890-3. pp. 490-494.

[thumbnail of DL_Scheduling_05513462.pdf]

PDF
DL_Scheduling_05513462.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (138kB)

Abstract

We consider the problem of scheduling jobs with given start and finish times over two classes of multi-user channels, namely Multiple Access Channels and Degraded Broadcast Channels, and derive necessary and sufficient conditions for feasible scheduling of the jobs.

Item Type:	Article
Keywords:	Scheduling; hard deadlines; Multiple Access; Degraded Broadcast Channels; Gaussian channels; multi-access systems; wireless channels;
Academic Unit:	Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	2206
Depositing User:	Professsor Douglas Leith
Date Deposited:	19 Oct 2010 15:58
Journal or Publication Title:	Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on . ISBN 978-1-4244-7890-3
Publisher:	IEEE
Refereed:	Yes
Related URLs:	http://ieeexplore.ieee.org/Xplore/dynhom...
URI:	https://mural.maynoothuniversity.ie/id/eprint/2206
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

MURAL - Maynooth University Research Archive Library

Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels

Abstract

Repository Staff Only (login required)

Downloads

Origin of downloads