首页> 外国专利> GPU APPARATUS AND METHOD FOR OPTIMAL SPLIT SIZE DECISION IN DEEP LEARNING USING MULTI-GPU AND METHOD FOR LEARNING DEEP LEARNING MODEL USING THE SAME

GPU APPARATUS AND METHOD FOR OPTIMAL SPLIT SIZE DECISION IN DEEP LEARNING USING MULTI-GPU AND METHOD FOR LEARNING DEEP LEARNING MODEL USING THE SAME

机译:使用Multi-GPU和学习深层学习模型的深度学习中最佳分裂尺寸决定的GPU装置和方法

摘要

Disclosed are an apparatus and method for determining an optimal split size for training a deep learning model using multi-GPU and a method for learning a deep learning model using the same, and determining an optimal split size for training a deep learning model using multi-GPU according to an embodiment of the present application The method includes the steps of (a) calculating an initial split size based on the number of GPUs included in the multi-GPU and the memory size of the multi-GPU, (b) a preset number of times performed based on the initial split size calculating an initial execution time required for iterative learning, (c) between the initial split size and the initial execution time, and between (n-1)-th split size, n-th split size, and (n+1)-th split size Based on the relationship set in , the nth split size, the nth execution time required for iterative learning for a preset number of times performed based on the nth split size, the (n+1)th split size, and the (n+ 1) obtaining an (n+1)-th execution time required for iterative learning for a preset number of times performed based on the size of the th split, and (d) the n-th execution time and the (n+1)-th execution If the time difference between times is within a preset time difference, determining the (n+1)th split size as an optimal split size may include.
机译:公开了一种用于确定使用多GPU训练深度学习模型的最佳分割大小的装置和方法,以及使用相同学习深度学习模型的方法,并确定使用多个训练深层学习模型的最佳分割大小根据本申请的一个实施例的GPU该方法包括(a)的步骤,其步骤基于包括在多gpu中包括的GPU的数量和多GPU的存储器大小的GPU的数量来计算初始分割大小,(b)预设基于初始分割大小执行的次数,计算迭代学习所需的初始执行时间,(c)在初始分割大小和初始执行时间之间,并且在(n-1)裂缝之间,第n个拆分尺寸和(n + 1) - 基于关系中的关系,第n个分割大小,第n个执行时间,迭代学习所需的第n个执行时间,用于基于第n个分裂大小执行的预设次数,(n + 1)分裂尺寸,(n + 1)托迭代学习所需的(n + 1)-th执行时间所需的预设次数,基于th拆分的大小,(d)第n执行时间和(n + 1)-th执行如果次数之间的时间差在预设的时间差内,则将(n + 1)的分割大小确定为最佳分割大小可以包括。

著录项

  • 公开/公告号KR20210141240A

    专利类型

  • 公开/公告日2021-11-23

    原文格式PDF

  • 申请/专利权人 한국항공대학교산학협력단;

    申请/专利号KR20200058647

  • 发明设计人 이재환;이명성;최현성;

    申请日2020-05-15

  • 分类号G06N3/08;G06N3/04;G06T1/20;

  • 国家 KR

  • 入库时间 2022-08-24 22:31:32

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号