최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Applied sciences, v.10 no.7, 2020년, pp.2634 -
Yoon, JunWeon (Supercomputing Center, KISTI, 245 Daehak-ro, Yuseong-Gu, Daejeon 34141, Korea) , Hong, TaeYoung (Supercomputing Center, KISTI, 245 Daehak-ro, Yuseong-Gu, Daejeon 34141, Korea) , Park, ChanYeol (Supercomputing Center, KISTI, 245 Daehak-ro, Yuseong-Gu, Daejeon 34141, Korea) , Noh, Seo-Young (Department of Computer Science, Chungbuk National University, Chungbuk 28644, Korea) , Yu, HeonChang (Department of Computer Science and Engineering, Korea University, Seoul 02841, Korea)
High-performance computing (HPC) uses many distributed computing resources to solve large computational science problems through parallel computation. Such an approach can reduce overall job execution time and increase the capacity of solving large-scale and complex problems. In the supercomputer, t...
Marco The glite workload management system Journal of Physics 2010 Volume 219 062039
Abawajy An efficient adaptive scheduling policy for high-performance computing Future Gener. Comput. Syst. 2009 10.1016/j.future.2006.04.007 25 364
Espling Decentralized scalable fairshare scheduling Future Gener. Comput. Syst. 2013 10.1016/j.future.2012.06.001 29 130
(2020, February 11). National Institute of Supercomputing and Networking, KISTI. Available online: http://www.ksc.re.kr.
10.1109/SC.2018.00012 Das, A., Mueller, F., Hargrove, P., Roman, E., and Baden, S. (2018, January 11-16). Doomsday: Predicting which node will fail when on supercomputers. Proceedings of the SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, Dallas, TX, USA.
Shanley, T. (2003). InfiniBand Network Architecture, Addison-Wesley Professional.
Chaubal, C. (2005). Scheduler Policies for Job Prioritization in the Sun N1 Grid Engine 6 System, Sun Microsystems, Inc.. Technical Report.
Lipari, D. (2012, January 9). The SLURM Scheduler Design. Proceedings of the SLURM User Group Meeting, Barcelona, Spain.
Bode, B., Halstead, D.M., Kendall, R., Lei, Z., and Jackson, D. (2000, January 10-14). The Portable Batch Scheduler and the Maui Scheduler on Linux Clusters. Proceedings of the Annual Linux Showcase & Conference, Atlanta, GA, USA.
Kannan, S., Roberts, M., Mayes, P., Brelsford, D., and Skovira, J.F. (2001). Workload Management with Loadleveler, IBM Redbooks.
Iqbal, S., Gupta, R., and Fang, Y.C. (2005). Planning considerations for job scheduling in HPC clusters. Dell Power Solution., 133-136.
Kettimuthu, R., Subramani, V., Srinivasan, S., Gopalasamy, T., Panda, D.K., and Sadayappan, P. (2002, January 21). Selective preemption strategies for parallel job scheduling. Proceedings of the International Conference on Parallel Processing, IEEE, Vancouver, BC, Canada.
Yoon, J., Hong, T., Park, C., and Yu, H. (2013, January 10-12). Analysis of Batch Job log to improve the success rate in HPC Environment. Proceedings of the International Conference on Convergence Technology, Seoul, Korea.
Schwiegelshohn, U., and Yahyapour, R. (1998, January 25-27). Analysis of first-come-first-serve parallel job scheduling. Proceedings of the SODA, San Francisco, CA, USA.
10.1007/10968987_1 Hovestadt, M., Kao, O., Keller, A., and Streit, A. (2003). Scheduling in HPC resource management systems: Queuing vs. planning. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.
Yuan Guarantee strict fairness and utilize prediction better in parallel job scheduling IEEE Trans. Parallel Distrib. Syst. 2014 10.1109/TPDS.2013.88 25 971
Etsion, Y., and Tsafrir, D. (2005). A Short Survey of Commercial Cluster Batch Schedulers, School of Computer Science and Engineering, The Hebrew University of Jerusalem.
Klusáček, D., and Chlumský, V. (2015). Planning and metaheuristic optimization in production job scheduler. Job Scheduling Strategies for Parallel Processing, Springer.
10.1007/3-540-60153-8_34 Henderson, R.L. (1995). Job scheduling under the portable batch system. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.
Feitelson, D.G., and Weil, A.M.A. (April, January 30). Utilization and predictability in scheduling the IBM SP2 with backfilling. Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, Orlando, FL, USA.
Srinivasan, S., Kettimuthu, R., Subramani, V., and Sadayappan, P. (2002, January 21). Characterization of backfilling strategies for parallel job scheduling. Proceedings of the International Conference on Parallel Processing Workshop, Vancouver, BC, Canada.
해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.