메뉴 건너뛰기




Volumn , Issue , 2001, Pages 387-392

A generalized air-cache design for efficiently broadcasting on multiple physical channels

Author keywords

Air cache; Data broadcast; Mobile computing; Scheduling

Indexed keywords

MOBILE COMPUTING; SCHEDULING;

EID: 85013575926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/372202.372379     Document Type: Conference Paper
Times cited : (14)

References (16)
  • 1
    • 84976840503 scopus 로고
    • Broadcast disks: Data management for asymmetric communications environments
    • May
    • S. Acharya, R. Alonso, M. FrarLklin, and S. Zdonik. Broadcast disks: Data management for asymmetric communications environments. In Proe. of 1995 ACM SIGMOD, pages 199-210, May 1995.
    • (1995) Proe. of 1995 ACM SIGMOD , pp. 199-210
    • Acharya, S.1    Alonso, R.2    FrarLklin, M.3    Zdonik, S.4
  • 2
    • 0003138736 scopus 로고    scopus 로고
    • Disseminating updates on broadcast disks
    • September
    • S. Acharya, M. Franklin, and S. Zdonik. Disseminating updates on broadcast disks. In Proc. of VLDB, pages 354-365, September 1996.
    • (1996) Proc. of VLDB , pp. 354-365
    • Acharya, S.1    Franklin, M.2    Zdonik, S.3
  • 3
    • 0029769881 scopus 로고    scopus 로고
    • Prefetching from a broadcast disk
    • New Orleans, USA, September
    • S. Acharya, M. Franklin, and S. Zdonik. Prefetching from a broadcast disk. In Proc. of IEEE DATA ENGINEERING, pages 276-285, New Orleans, USA, September 1996.
    • (1996) Proc. of IEEE DATA ENGINEERING , pp. 276-285
    • Acharya, S.1    Franklin, M.2    Zdonik, S.3
  • 5
    • 0033893767 scopus 로고    scopus 로고
    • Broadcast disks with polynomial cost functions
    • Jerusalem, Israel.
    • A. Bar-Noy, B. Patt-Shamir, and I. Ziper. Broadcast disks with polynomial cost functions. In Proc. of IEEE INFOCOM, Jerusalem, Israel., 2000.
    • (2000) Proc. of IEEE INFOCOM
    • Bar-Noy, A.1    Patt-Shamir, B.2    Ziper, I.3
  • 6
    • 0030676605 scopus 로고    scopus 로고
    • Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems
    • Birmingham, U.K., April
    • S. Baruah and A. Bestavros. Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems. In Proc. of the 13th IEEE DATA ENGINEERING, pages 543-551, Birmingham, U.K., April 1997.
    • (1997) Proc. of the 13th IEEE DATA ENGINEERING , pp. 543-551
    • Baruah, S.1    Bestavros, A.2
  • 7
    • 0030701458 scopus 로고    scopus 로고
    • Adaptive broadcast protocols to support efficient and energy conserving retrieval from databases in mobile computing environments
    • Birmingham, U.K., April
    • A. Datta, A. Celik, J. Kim, D. VanderMeer, and V. Kumar. Adaptive broadcast protocols to support efficient and energy conserving retrieval from databases in mobile computing environments. In Proc. of the 13th IEEE DATA ENGINEERING, pages 124-133, Birmingham, U.K., April 1997.
    • (1997) Proc. of the 13th IEEE DATA ENGINEERING , pp. 124-133
    • Datta, A.1    Celik, A.2    Kim, J.3    VanderMeer, D.4    Kumar, V.5
  • 8
    • 0346207638 scopus 로고    scopus 로고
    • Broadcast protocols to support efficient retrieval from databases by mobile users
    • March
    • A. Datta, A. Celik, and V. Kumar. Broadcast protocols to support efficient retrieval from databases by mobile users. A CM Transactions on Database Systems, 24(1):1-79, March 1999.
    • (1999) A CM Transactions on Database Systems , vol.24 , Issue.1 , pp. 1-79
    • Datta, A.1    Celik, A.2    Kumar, V.3
  • 9
    • 84976838851 scopus 로고
    • Mobile computing and databases: Anything new?
    • 5-9 December
    • M. H. Dunhazn and A. Helal. Mobile computing and databases: Anything new? SIGMOD RECORD, 24(4):5-9, December 1995.
    • (1995) Sigmod Record , vol.24 , Issue.4
    • Dunhazn, M.H.1    Helal, A.2
  • 10
    • 0032089742 scopus 로고    scopus 로고
    • Data in your face: Push technology in perspective
    • Seattle, USA, June
    • M. Franklin and S. Zdonik. Data in your face: Push technology in perspective. In Proc. of ACM SIGMOD, Seattle, USA, June 1998.
    • (1998) Proc. of ACM SIGMOD
    • Franklin, M.1    Zdonik, S.2
  • 11
    • 0030686150 scopus 로고    scopus 로고
    • Log-time algorithms for scheduling single and multiple channel data broadcast
    • Budapest, Hungary
    • S. Hameed and N. H. Vaidya. Log-time algorithms for scheduling single and multiple channel data broadcast. In Proc. of ACM MOBICOM, pages 90-99, Budapest, Hungary, 1997.
    • (1997) Proc. of ACM MOBICOM , pp. 90-99
    • Hameed, S.1    Vaidya, N.H.2
  • 12
    • 84978060046 scopus 로고    scopus 로고
    • Scheduling data broadcast to impatient users
    • Seattle, USA
    • S. Jiang and N. H. Vaidya. Scheduling data broadcast to impatient users. In Proc. of ACM MobiDE, pages 52-59, Seattle, USA, 1999.
    • (1999) Proc. of ACM MobiDE , pp. 52-59
    • Jiang, S.1    Vaidya, N.H.2
  • 13
    • 0000339680 scopus 로고
    • Performance bounds for simple one-dimensional bin packing algorithms
    • D. Johnson, A. Demers, J. Unman, M. Garey, and M. Graham. Performance bounds for simple one-dimensional bin packing algorithms. SIAM Journal on Computing, 3(4):299-325, 1974.
    • (1974) SIAM Journal on Computing , vol.3 , Issue.4 , pp. 299-325
    • Johnson, D.1    Demers, A.2    Unman, J.3    Garey, M.4    Graham, M.5
  • 15
    • 0033890355 scopus 로고    scopus 로고
    • Multi-level multi-channel air cache designs for broadcasting in a mobile environment
    • K. Prabhahara, K. A. Hua, and J. H. Oh. Multi-level multi-channel air cache designs for broadcasting in a mobile environment. In Proc. of IEEE DATA ENGINEERING, USA, 2000
    • (2000) Proc. of IEEE DATA ENGINEERING, USA
    • Prabhahara, K.1    Hua, K.A.2    Oh, J.H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.