Jia Ru

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Li Hao

> Home > Persons > Jia Ru

Publications

2021
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/RuYGKH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/RuYGKH21
Jia Ru, Yun Yang, John C. Grundy, Jacky Keung, Li Hao:
An efficient deadline constrained and data locality aware dynamic scheduling framework for multitenancy clouds. Concurr. Comput. Pract. Exp. 33(5) (2021)
2019
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/IEEEcloud/Ru00KH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/IEEEcloud/Ru00KH19
Jia Ru, Yun Yang, John Grundy, Jacky Keung, Li Hao:
A Deadline Constrained Preemptive Scheduler Using Queuing Systems for Multi-Tenancy Clouds. CLOUD 2019: 63-67
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/IEEEcloud/Ru00KH19a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/IEEEcloud/Ru00KH19a
Jia Ru, Yun Yang, John Grundy, Jacky Keung, Li Hao:
A Highly Efficient Data Locality Aware Task Scheduler for Cloud-Based Systems. CLOUD 2019: 496-498
2015
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/cloudcom/RuGYKH15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cloudcom/RuGYKH15
Jia Ru, John C. Grundy, Yun Yang, Jacky W. Keung, Li Hao:
Providing Fairer Resource Allocation for Multi-tenant Cloud-Based Systems. CloudCom 2015: 306-313

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.