Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation
暂无分享,去创建一个
[1] K. Mani Chandy,et al. A distributed algorithm for detecting resource deadlocks in distributed systems , 1982, PODC '82.
[2] Sam Toueg,et al. A distributed algorithm for generalized deadlock detection , 1984, PODC '84.
[3] Prabhakar Raghavan,et al. Provably good routing in graphs: regular arrays , 1985, STOC '85.
[4] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[5] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[6] P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[7] Baruch Awerbuch,et al. Dynamic deadlock resolution protocols , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[8] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[9] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.
[10] Giorgio Gambosi,et al. Time-Stamp Approach to Store-and-Forward Deadlock Prevention , 1987, IEEE Trans. Commun..
[11] Bruce M. Maggs,et al. Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] Andrew V. Goldberg,et al. Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.
[13] S. T. Chanson,et al. A hierarchical solution for application level store-and-forward deadlock prevention , 1989, SIGCOMM 1989.
[14] Michael E. Saks,et al. A dining philosophers algorithm with polynomial response time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[15] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[16] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[18] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[19] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[20] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[21] Moti Yung,et al. Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[22] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[23] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[24] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.
[25] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[26] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[27] Y. Mansour,et al. Eecient On-line Call Control Algorithms , 1993 .
[28] Yossi Azar,et al. Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.
[29] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.
[30] Lenore Cowen,et al. Efficient asynchronous distributed symmetry breaking , 1994, STOC '94.
[31] Richard J. Lipton,et al. Online interval scheduling , 1994, SODA '94.
[32] Carsten Lund,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[33] David P. Williamson,et al. Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..
[34] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.