Abstract | ||
---|---|---|
We study an online fault-tolerant bin packing problem that models reliable resource allocation. In this problem, each item is replicated and has f + 1 replicas including one primary and f standbys. The packing of items is required to tolerate up to f faulty bins, i.e., to guarantee that at least one correct replica of each item is available regardless of which f bins turn to be faulty. Any feasibl... |
Year | DOI | Venue |
---|---|---|
2020 | 10.1109/TPDS.2019.2948327 | IEEE Transactions on Parallel and Distributed Systems |
Keywords | Field | DocType |
Fault tolerance,Fault tolerant systems,Servers,Resource management,Heuristic algorithms,Switches | Computer science,Fault tolerance,Resource allocation,Bin packing problem,Distributed computing | Journal |
Volume | Issue | ISSN |
31 | 4 | 1045-9219 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chuanyou Li | 1 | 9 | 4.31 |
Xueyan Tang | 2 | 1559 | 92.36 |