Earticle

현재 위치 Home

Task Scheduling Based on Degenerated Monte Carlo Estimate in Mobile Cloud

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJGDC) 바로가기
  • 간행물
    International Journal of Grid and Distributed Computing 바로가기
  • 통권
    Vol.7 No.1 (2014.02)바로가기
  • 페이지
    pp.179-196
  • 저자
    Cai Zhiming, Chen Chongcheng
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A217402

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
Mobile cloud computing, which comes up in recent years, is a new computing paradigm. It enables people to access remote clouds by mobile device, even to build mobile micro-cloud(MuCloud) with mobile device to provide lightweight service. Despite extensive studies of task scheduling in wired cloud, effective scheduling in mobile cloud still remains challenges:1) Unreliable wireless connection and dynamic join and quit of MuCloud often result in decreased reliability of scheduling; 2) As the process capacities of wired clouds and MuClouds vary greatly, it is hard to achieve load balancing; 3) During moving, tasks, such as traffic navigation, may be scheduled consecutively by mobile users as space-time changes. Such application scenarios often incur makespan accumulation which impairs user experience, even causes system crash. Our work aims at such problems. We firstly illustrate the reason for selection of makespan and load balancing as two key performance indicators for task scheduling in the proposed architecture of mobile cloud which integrates MuClouds. Then after introduction to Monte Carlo method, degenerated Monte Carlo estimate is defined and a scheduling algorithm based on degenerated Monte Carlo estimate (DMCE) is presented. With extensive simulation experiments, the two above-mentioned indicators of task scheduling using different algorithms including DMCE, Max-Min, Min-Min and IGA are compared and evaluated. Accumulative effect and relative load are introduced to measure scheduling performance. The experimental results show that: 1)Compared with other algorithms, DMCE achieves smallest makespan on average when scheduled respectively; 2) DMCE has least accumulative effect when task sets scheduled consecutively, which makes makespan of a task set hardly relevant to the order of scheduling; 3)Among these algorithms, DMCE outperforms others in keeping relative load balancing by assigning tasks to clouds in proportion to each cloud’s process capacity.

목차

Abstract
 1. Introduction
 2. Architecture of Mobile Cloud and Scheduling Description
  2.1. Architecture of Mobile Cloud
  2.2. Estimate of Time of Complete
  2.3. Relationship of TOC and Reliability of Task Scheduling
 3. Degenerated Monte Carlo Estimate-based Task Scheduling
  3.1. Monte Carlo Method
  3.2. DMCE-based Task Scheduling Algorithm
 4. Simulation Experiment and Performance Evaluation
  4.1. Experiment Configurations
  4.2. Makespan and Accumulative Effect
  4.3. Relative Load
  4.4. Degenerated Degree
 5. Conclusions and Future Works
 Acknowledgments
 References

키워드

Task Scheduling Degenerated Monte Carlo Estimate Mobile Cloud Makespan Relative Load Balancing

저자

  • Cai Zhiming [ Key Lab of Spatial Data Mining & Information Sharing of Ministry of Education, Fuzhou University, School of Information Science and Engineering, Fujian University of Technology, Fuzhou, 350108, China ]
  • Chen Chongcheng [ Key Lab of Spatial Data Mining & Information Sharing of Ministry of Education, Fuzhou University, Fuzhou, 350002, China ] Corresponding author

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Grid and Distributed Computing
  • 간기
    격월간
  • pISSN
    2005-4262
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.7 No.1

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장