Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems
暂无分享,去创建一个
[1] M. D. Beaudry,et al. Performance-Related Reliability Measures for Computing Systems , 1978, IEEE Transactions on Computers.
[2] L. Christie,et al. Queuing with Preemptive Priorities or with Breakdown , 1958 .
[3] Leonard Kleinrock,et al. Distributed systems and transient processors , 1989 .
[4] Leonard Kleinrock. Distributed Systems , 1985, Computer.
[5] Leonard Kleinrock,et al. The Benevolent Bandit Laboratory: a testbed for distributed algorithms , 1989, IEEE J. Sel. Areas Commun..
[6] D. Gaver. A Waiting Line with Interrupted Service, Including Priorities , 1962 .
[7] John F. Meyer,et al. On Evaluating the Performability of Degradable Computing Systems , 1980, IEEE Transactions on Computers.
[8] James R. Lyle,et al. Load balancing from a Unix shell , 1988, Proceedings [1988] 13th Conference on Local Computer Networks.
[9] Miron Livny,et al. Profiling Workstations' Available Capacity for Remote Execution , 1987, Performance.
[10] Lorenzo Donatiello,et al. Closed-Form Solution for System Availability Distribution , 1987, IEEE Transactions on Reliability.
[11] B. T. Doshi,et al. Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..
[12] John F. Meyer,et al. Closed-Form Solutions of Performability , 1982, IEEE Transactions on Computers.
[13] Philip Heidelberger,et al. Analysis of Performability for Stochastic Models of Fault-Tolerant Systems , 1986, IEEE Transactions on Computers.
[14] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .
[15] R. Chawla,et al. The Stealth distributed scheduler , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[16] Krishna R. Pattipati,et al. On the Computational Aspects of Performability Models of Fault-Tolerant Computer Systems , 1990, IEEE Trans. Computers.
[17] Prem S. Puri,et al. A method for studying the integral functionals of stochastic processes with applications: I. Markov chain case , 1971, Journal of Applied Probability.
[18] Robbert van Renesse,et al. Amoeba A Distributed Operating System for the 1990 s Sape , 1990 .
[19] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .
[20] Michael Stumm,et al. The design and implementation of a decentralized scheduling facility for a workstation cluster , 1988, [1988] Proceedings. 2nd IEEE Conference on Computer Workstations.
[21] Leonard Kleinrock,et al. Queueing Systems: Volume I-Theory , 1975 .
[22] Awi Federgruen,et al. Queueing Systems with Service Interruptions , 1986, Oper. Res..
[23] John F. Shoch,et al. The “worm” programs—early experience with a distributed computation , 1982, CACM.
[24] K. Thiruvengadam. Queuing with Breakdowns , 1963 .
[25] David A. Nichols,et al. Using idle workstations in a shared computing environment , 1987, SOSP '87.
[26] Miron Livny,et al. Scheduling Remote Processing Capacity in a Workstation-Processor Bank Network , 1987, ICDCS.
[27] Rafael Alonso,et al. Sharing jobs among independently owned processors , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[28] Edmundo de Souza e Silva,et al. Calculating availability and performability measures of repairable computer systems using randomization , 1989, JACM.
[29] J. Wolfowitz,et al. Introduction to the Theory of Statistics. , 1951 .
[30] Kishor S. Trivedi,et al. Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.
[31] Miron Livny,et al. Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[32] Hany H. Ammar,et al. Performability of the hypercube (reliability) , 1989 .
[33] Kishor S. Trivedi,et al. NUMERICAL EVALUATION OF PERFORMABILITY AND JOB COMPLETION TIME IN REPAIRABLE FAULT-TOLERANT SYSTEMS. , 1990 .