skip to main content
article
Free Access

Airdisks and airRAID (expanded extract): modeling and scheduling periodic wireless data broadcast

Published:01 September 1995Publication History
Skip Abstract Section

Abstract

A new generation of low-cost, low-power, and portable personal computer systems is emerging; sometimes these are referred to as palmtops or Personal Digital Assistants (PDAs). One of their key features is that they utilize wireless communication media, thus freeing the user from the constraints of wired or tethered communication. In fact, the wireless medium becomes a critical component of the I/O subsystem, allowing communication with fixed servers and other users. In particular, the broadcast nature of the wireless medium can be exploited to efficiently transmit information required by a large number of PDA users (e.g. stock quotes, sports updates, etc.), with software on the PDA being used to filter the information and present only the information of interest to the PDA user.We introduce a simple model, called the airdisk, for modeling the access of data transmitted periodically over wireless media as being analogous to the access of data from a standard magnetic disk. We consider several issues related to airdisks, such as their mean rotational latency under certain assumptions. The problem of scheduling the order in which data items are broadcast is analogous to that of determining how data should be laid out on the disk. Two problems of laying out data so as to minimize read time, given information about which data items are of most interest to the clients, are defined; both are shown to be NP-complete. We discuss ways in which the information about which items are of interest to clients can be obtained. Finally we consider how to increase the performance and storage capacity of airdisks, using the magnetic disk analogy as a guide. We suggest using multiple-track airdisks or borrowing the idea of Redundant Arrays of Inexpensive Disks (RAID) which is used for magnetic disks; for the wireless data broadcast environment we call the latter approach airRAID.

References

  1. {1} D. Adolphson and T. C. Hu. Optimal linear ordering. SIMA J. Appl. Math., 25:403-423, 1973.Google ScholarGoogle ScholarCross RefCross Ref
  2. {2} B. R. Badrinath and T. Imielinski. Data management issues in mobile computing. In Wireless Datacomm '92, 1992.Google ScholarGoogle Scholar
  3. {3} Bellcore. Feature description and functional analysis of Personal Communications Services (PCS) capabilities. Special Report. SR-INS-002301, Bellcore, Apr. 1992.Google ScholarGoogle Scholar
  4. {4} Bellcore. Generic criteria for Version 0.1 Wireless Access Communications Systems (WACS). Technical Advisory TA-NWT-001313, Issue 1, Bellcore, July 1992.Google ScholarGoogle Scholar
  5. {5} T. Chiueh. Scheduling for broadcast-based file systems. In Proc. MOBIDATA Workshop. Rutgers University, Nov. 1994.Google ScholarGoogle Scholar
  6. {6} Juan Miguel del Rosario, R. Bordawekar, and Alok Chaudhary. Improved parallel I/O via a two-phase run-time access strategy. In Proc. Workshop on I/O in Parallel Computer Systems, pages 56-70, 1993. Also in ACM SIGARCH Comp. Arch. News., Dec. 1993.Google ScholarGoogle Scholar
  7. {7} G. Herman et al. The Datacycle architecture for very large high throughput database systems. In Proc. SIGMOD , pages 97-103, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {8} Ravi Jain et al. Airdisks and AirRAID. 1995. In preparation.Google ScholarGoogle Scholar
  9. {9} T. F. Bowen et al. The Datacycle architecture. Comm. ACM, pages 71-81, Dec. 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. {10} M. Garey and D. Johnson. Computers and intractability: A guide to the theory of NP-completeness. Freeman, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. {11} J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. {12} Ravi Jain and John Werth. Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast. DIMACS Tech. Report 95-11, Rutgers Univ., May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. {13} Leonard Kleinrock. Queuing Systems Volume I: Theory. Wiley, 1975.Google ScholarGoogle Scholar
  14. {14} David Patterson, Garth Gibson, and Randy Katz. A case for redundant arrays of inexpensive disks (RAID). In ACM SIGMOD Conference, pages 109-116, June 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. {15} S. Viswanathan T. Imielinski and B.R. Badrinath. Energy efficient indexing on air. In Proc. SIGMOD, pages 25-36, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. {16} A. Tanenbaum. Computer Networks. Prentice-Hall, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Airdisks and airRAID (expanded extract): modeling and scheduling periodic wireless data broadcast

          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

          Full Access

          • Published in

            cover image ACM SIGARCH Computer Architecture News
            ACM SIGARCH Computer Architecture News  Volume 23, Issue 4
            Sept. 1995
            32 pages
            ISSN:0163-5964
            DOI:10.1145/218864
            Issue’s Table of Contents

            Copyright © 1995 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 September 1995

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader