• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Tang Lei, Liao Yuan, Li Mingshu, Huai Xiaoyong. The Dynamic Deployment Problem and the Algorithm of Service Component for Pervasive Computing[J]. Journal of Computer Research and Development, 2007, 44(5): 815-822.
Citation: Tang Lei, Liao Yuan, Li Mingshu, Huai Xiaoyong. The Dynamic Deployment Problem and the Algorithm of Service Component for Pervasive Computing[J]. Journal of Computer Research and Development, 2007, 44(5): 815-822.

The Dynamic Deployment Problem and the Algorithm of Service Component for Pervasive Computing

More Information
  • Published Date: May 14, 2007
  • Due to resource limitation, the embedded devices connect with each other through network and share resources to provide flexible services in pervasive computing environment. In order to reuse the component and reduce the software cost, the service components should be composed to provide new service. Because the composite service can not run in one device, the dynamic deployment problem of many service components for pervasive computing has become a research focus. Based on Liquid—an embedded and component-based system, a dynamic deployment problem and the algorithm of service component for pervasive computing are presented. First, the service model is described and the problem of dynamic deployment in the pervasive computing environment is defined. Second, according to the resource constraint conditions and two deployment goals of service component, the randomized algorithm and the heuristic algorithm are given to solve the problem. Finally, the experiment data is given to analyze and compare the performance of the different algorithms. According to the method, the service components are deployed into the embedded devices to satisfy resource requirement and improve the resource utilization. The algorithm simulation and analysis indicate that it can be applied to the pervasive computing environment with more devices or service components.
  • Related Articles

    [1]Guo Jing, Hu Cunchen, Bao Yungang. A Dynamic Resource Allocation Method for High-Density Colocation Scenario[J]. Journal of Computer Research and Development, 2024, 61(9): 2384-2399. DOI: 10.7544/issn1000-1239.202221043
    [2]Yang Yong, Meng Xiangru, Kang Qiaoyan, Chen Gang. Dynamic Service Function Chain Migration Method Based on Resource Requirements Prediction[J]. Journal of Computer Research and Development, 2023, 60(5): 1151-1163. DOI: 10.7544/issn1000-1239.202111206
    [3]Li Liying, Zhang Runze, Wei Tongquan. Service Decoupling and Deployment Strategy for Edge Computing[J]. Journal of Computer Research and Development, 2023, 60(5): 1073-1085. DOI: 10.7544/issn1000-1239.202220736
    [4]Su Mingfeng, Wang Guojun, Li Renfa. Resource Deployment with Prediction and Task Scheduling Optimization in Edge Cloud Collaborative Computing[J]. Journal of Computer Research and Development, 2021, 58(11): 2558-2570. DOI: 10.7544/issn1000-1239.2021.20200621
    [5]Tang Zhuo, Zhu Min, Yang Li, Tang Xiaoyong, Li Kenli. Random Task-Oriented User Utility Optimization Model in the Cloud Environment[J]. Journal of Computer Research and Development, 2014, 51(5): 1120-1128.
    [6]Wang Jianzong, Chen Yanjun, Xie Changsheng. Research on I/O Resource Scheduling Algorithms for Utility Optimization Towards Cloud Storage[J]. Journal of Computer Research and Development, 2013, 50(8): 1657-1666.
    [7]Wu Wei, Ni Shaojie, and Wang Feixue. A Fault-Tolerant Scheduling Method Based on Predictable Deadline Miss Ratio in High Utilization[J]. Journal of Computer Research and Development, 2010, 47(2): 370-376.
    [8]Tang Lei, Huai Xiaoyong, Li Mingshu. An Approach to Dynamic Service Composition Based on Context Negotiation[J]. Journal of Computer Research and Development, 2008, 45(11): 1902-1910.
    [9]Hu Chunming, Huai Jinpeng, and Wo Tianyu. Flexible Resource Capacity Reservation Mechanism for Service Grid Using Slack Time[J]. Journal of Computer Research and Development, 2007, 44(1): 20-28.
    [10]Li Zhong, Wang Gang, Liu Jing. Quality of Service Aware Dynamic Priority Scheduling Scheme for the Mixed Class Multimedia Workloads in the Storage Systems[J]. Journal of Computer Research and Development, 2006, 43(11): 2027-2032.

Catalog

    Article views (533) PDF downloads (618) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return