正在加载图片...
AsySVRG Lock-free Analysis:update sequence According to (1),we define a sequence {um}as follows: m-1 =w+∑B,A (2) which means um+1 =um+BmAm. Note The sequence {um}(m=1,2,...,M-1)is synthetic,and the whole um may never occur in the shared memory.What we can get is only the final value of uM 4口,4@下4242,2QC Wu-Jun Li (http://cs.nju.edu.cn/lwj) PDSL CS,NJU 13 /36AsySVRG Lock-free Analysis: update sequence According to (1), we define a sequence {um} as follows: um = u0 + mX−1 i=0 Bi∆i (2) which means um+1 = um + Bm∆m. Note The sequence {um} (m = 1, 2, . . . , M˜ − 1) is synthetic, and the whole um may never occur in the shared memory. What we can get is only the final value of uM˜ . Wu-Jun Li (http://cs.nju.edu.cn/lwj) PDSL CS, NJU 13 / 36
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有