skip to main content
10.1145/1774088.1774208acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Profit-based on-demand broadcast scheduling of real-time multi-item requests

Authors Info & Claims
Published:22 March 2010Publication History

ABSTRACT

On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.

References

  1. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for computing Machinery, 20(1):46--61, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Saxena, C. Pinotti, and S. Das. A probabilistic push-pull hybrid scheduling algorithm for asymmetric wireless environment. In IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004, pages 5--9, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  3. H. Schwetman. CSIM19: CSIM19: a powerful tool for building system models. In Proceedings of the 33nd conference on Winter simulation, pages 250--255. IEEE Computer Society Washington, DC, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Wong. Broadcast delivery. Proceedings of the IEEE, 76(12):1566--1577, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Wong and M. Ammar. Analysis of broadcast delivery in a videotex system. IEEE Transactions on Computers, 100(34):863--866, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Xu, X. Tang, and W. Lee. Time-critical on-demand data broadcast: Algorithms, analysis, and performance evaluation. IEEE Transactions on Parallel and Distributed Systems, 17(1):3--14, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Profit-based on-demand broadcast scheduling of real-time multi-item requests

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing
            March 2010
            2712 pages
            ISBN:9781605586397
            DOI:10.1145/1774088

            Copyright © 2010 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 22 March 2010

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            SAC '10 Paper Acceptance Rate364of1,353submissions,27%Overall Acceptance Rate1,650of6,669submissions,25%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader