2015
DOI: 10.1109/tpds.2014.2340864
|View full text |Cite
|
Sign up to set email alerts
|

Elections and Reputation for High Dependability and Performance in Distributed Workload Execution

Abstract: Reputation systems use historical information about a service as the basis to predict its future behavior. In this work, we present a reputation-based task scheduling strategy for distributed database systems, which efficiently schedules workloads composed (or not) by best-effort oriented tasks and by tasks that have execution-related constraints. Available data services may participate in an election to choose the service that would execute each task. During task scheduling, each candidate service commits its… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 35 publications
0
0
0
Order By: Relevance