MrBool Java - In this article you will learn how to create a program which can be helpfull to you to run a particular task after a particular interval of time.
S. Boyd-Wickizer, R. Morris, und M. Kaashoek. Proceedings of the 12th conference on Hot topics in operating systems, Seite 21--21. Berkeley, CA, USA, USENIX Association, (2009)
G. Aupy, A. Benoit, F. Dufossé, und Y. Robert. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, Seite 135--136. New York, NY, USA, ACM, (2011)
S. Olivier, A. Porterfield, K. Wheeler, und J. Prins. Proceedings of the 1st International Workshop on Runtime and Operating Systems for Supercomputers, Seite 49--56. New York, NY, USA, ACM, (2011)
T. Sun, H. An, T. Wang, H. Zhang, und X. Sui. Proceedings of the 26th ACM international conference on Supercomputing, Seite 173--184. New York, NY, USA, ACM, (2012)
D. Jackson, Q. Snell, und M. Clement. Job Scheduling Strategies for Parallel Processing, Volume 2221 von Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2001)
A. Snavely, D. Tullsen, und G. Voelker. Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, Seite 66--76. New York, NY, USA, ACM, (2002)
N. Lakshminarayana, J. Lee, und H. Kim. Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, Seite 25:1--25:12. New York, NY, USA, ACM, (2009)
Y. Jiang, X. Shen, J. Chen, und R. Tripathi. Proceedings of the 17th international conference on Parallel architectures and compilation techniques, Seite 220--229. New York, NY, USA, ACM, (2008)
R. Henderson. Job Scheduling Strategies for Parallel Processing, Volume 949 von Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (1995)
G. Mounie, C. Rapine, und D. Trystram. Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, Seite 23--32. New York, NY, USA, ACM, (1999)
E. Anshelevich, und A. Karagiozova. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, Seite 391--400. New York, NY, USA, ACM, (2007)
R. Milidiú, A. Pessoa, und E. Laber. Approximation Algorithms for Combinatorial Optimization, Volume 2462 von Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2002)