Name
Abstract | ||
|---|---|---|
Current research on scheduling of workflow applications in Cloud environment is main focused on the trade-off between the execution cost and time of a task. However, unlike traditional scheduling, there are other important requirements to be taken into account. One such a requirement is trust scheduling, namely selecting trustful compute resources and data hosts so that the execution of applications. In this paper, we formulate the scheduling problem for workflow applications with trust constraints and present a novel scheduling algorithms based on trust. Experimental results illustrate that the proposed heuristic scheduling algorithm is better than the traditional algorithm for scheduling application workflows, and can find the most trusted execution flow efficiently. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/3PGCIC.2013.53 | 3PGCIC |
Keywords | Field | DocType |
traditional algorithm,scheduling,trust constraints,task time,trust-based workflow application scheduling strategy,trust scheduling,heuristic scheduling algorithm,trustful compute resource selection,data host selection,trust constraint,trusted computing,trust utility function,proposed heuristic scheduling algorithm,application execution,data-intensive workflow applications,scheduling problem,trust-based scheduling strategy,novel scheduling,data retrieval,traditional scheduling,trusted execution flow,workflow applications,cloud environment,execution cost,workflow application,cloud computing,execution flow | Lottery scheduling,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuli Yang | 1 | 8 | 2.27 |
| Xinguang Peng | 2 | 20 | 4.84 |