Broadcast scheduling with multiple concurrent costs
AuthorLiaskos, Christos K.
Papadimitriou, Georgios I.
SourceIEEE Transactions on Broadcasting
Google Scholar check
MetadataShow full item record
Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving time and the mean scheduling cost at the same time. This task has been proven to be NP-Hard, and related studies have gradually discarded the scheduling cost attribute in an effort to simplify the problem. The present study reinstates the cost attribute, as well as any number of additional cost attributes per data item. The proposed, MULTIOPT scheduling algorithm then achieves optimal mean serving time and mean values for all costs concurrently. Comparison with brute-force results and related approaches yield optimality in all tested cases. © 2012 IEEE.
Showing items related by title, author, creator and subject.
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling Philippou, Anna; Lee, I.; Sokolsky, O. (2012)As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using ...
Sakellariou, R.; Zhao, H.; Tsiakkouri, E.; Dikaiakos, Marios D. (Springer Science and Business Media, LLC, 2007)Grids are emerging as a promising solution for resource and computation demanding applications. However, the heterogeneity of resources in Grid computing, complicates resource management and scheduling of applications. In ...
Panayiotou, Christos G.; Cassandras, C. G. (1998)