Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Towards scalable and robust distributed intrusion alert fusion with good load balancing
Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense
Exploiting social networks for threshold signing: attack-resilience vs. availability
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Expecting the Unexpected: Towards Robust Credential Infrastructure
Financial Cryptography and Data Security
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
The dark side of threshold cryptography
FC'02 Proceedings of the 6th international conference on Financial cryptography
A fast algorithm for reliability-oriented task assignment in a distributed system
Computer Communications
| Hi-index | 0.00 |
We investigate the following problem: Given a set of l different operating systems (for heterogeneous sake) that are to run on l distinct servers, {S1,..., Sl}, and n applications (e.g., in threshold crypto-systems), Ai = {A(i,1),...,A(i,mi)}1≤i≤n, where l ≥ mi for all 1 ≤ i ≤ n, we want to assign servers to applications to achieve the optimal robustness in the presence of an adversary that is able to break some operating systems. We provide the theoretic models, heuristic optimal solutions, and simulating results toward solving this problem.