在jupyter notebook中如何对taichi计时

基本函数的计时

def is_prime(n: int):
    result = True
    for k in range(2,int(n**0.5)+1):
        if n%k == 0:
            result = False
            break
            
    return result

def count_primes(n: int) -> int:
    count = 0
    for k in range(2,n):
        if is_prime(k):
            count+=1
    return count

%time [print(count_primes(1000000))]

执行结果
78498
CPU times: total: 4.17 s
Wall time: 4.18 s

taichi on x86 cpu

import taichi as ti
ti.init()
@ti.func
def is_prime(n: int):
    result = True
    for k in range(2,int(n**0.5)+1):
        if n%k == 0:
            result = False
            break
            
    return result

@ti.kernel
def count_primes(n: int) -> int:
    count = 0
    for k in range(2,n):
        if is_prime(k):
            count+=1
    return count


%time [print(count_primes(100000000))]

执行结果
[Taichi] Starting on arch=x64
5761455
CPU times: total: 4min 5s
Wall time: 22.1 s

taichi on gpu rtx1060

import taichi as ti
ti.init(arch=ti.gpu)
@ti.func
def is_prime(n: int):
    result = True
    for k in range(2,int(n**0.5)+1):
        if n%k == 0:
            result = False
            break
            
    return result

@ti.kernel
def count_primes(n: int) -> int:
    count = 0
    for k in range(2,n):
        if is_prime(k):
            count+=1
    return count


%time [print(count_primes(10000000))]

执行结果
[Taichi] Starting on arch=cuda
664579
CPU times: total: 453 ms
Wall time: 452 ms

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值