所谓死锁:是指两个或两个以上的进程或线程在执行过程中,因争夺资源而造成的一种互相等待的现象,若无外力作用,它们都将无法推进下去。此时称系统处于死锁状态或系统产生了死锁,这些永远在互相等待的进程称为死锁进程
#科学家吃面问题
from threading import Thread,Lock
import time
lock1=Lock()
lock2=lock1def eat1(name):lock1.acquire()print('%s抓住了红buff' %name)time.sleep(1)lock2.acquire()print('%s抓住了蓝buff' %name)time.sleep(1)lock2.release()print('%s杀死了蓝buff' %name)time.sleep(1)lock1.release()print('%s杀死了红buff' %name)def eat2(name):lock2.acquire()print('%s抓住了蓝buff' %name)time.sleep(1)lock1.acquire()print('%s抓住了红buff' %name)time.sleep(1)lock1.release()print('%s杀死了红buff' %name)time.sleep(1)lock2.release()print('%s杀死了蓝buff' %name)if __name__ == '__main__':for name in ['盖伦','亚索','赵信']:t=Thread(target=eat1,args=(name,))t.start()for name in ['迪迦', '泰罗', '奈克瑟斯']:t1 = Thread(target=eat2, args=(name,))t1.start()
#输出结果
盖伦抓住了红buff#解决方法 递归锁RLock
from threading import Thread,Lock,RLock
import time
lock1=RLock()
lock2=lock1def eat1(name):lock1.acquire()print('%s抓住了红buff' %name)time.sleep(1)lock2.acquire()print('%s抓住了蓝buff' %name)time.sleep(1)lock2.release()print('%s杀死了蓝buff' %name)time.sleep(1)lock1.release()print('%s杀死了红buff' %name)def eat2(name):lock2.acquire()print('%s抓住了蓝buff' %name)time.sleep(1)lock1.acquire()print('%s抓住了红buff' %name)time.sleep(1)lock1.release()print('%s杀死了红buff' %name)time.sleep(1)lock2.release()print('%s杀死了蓝buff' %name)if __name__ == '__main__':for name in ['盖伦','亚索','赵信']:t=Thread(target=eat1,args=(name,))t.start()for name in ['迪迦', '泰罗', '奈克瑟斯']:t1 = Thread(target=eat2, args=(name,))t1.start()
queue队列:使用import queue,用法与进程Queue一样
同一个进程下多个线程数据是共享的
为什么先同一个进程下还会去使用队列呢
因为队列是
管道 + 锁
所以用队列还是为了保证数据的安全
#先进先出
import queueq=queue.Queue()
q.put('first')
q.put('second')
q.put('third')print(q.get())
print(q.get())
print(q.get())
'''
结果(先进先出):
first
second
third
'''#后进先出q=queue.LifoQueue()
q.put('first')
q.put('second')
q.put('third')print(q.get())
print(q.get())
print(q.get())
'''
结果(后进先出):
third
second
first
'''#优先级队列
import queueq=queue.PriorityQueue()
#put进入一个元组,元组的第一个元素是优先级(通常是数字,也可以是非数字之间的比较),数字越小优先级越高
q.put((20,'a'))
q.put((10,'b'))
q.put((10,'b1'))#优先级一样,小的先 比如 b1 b3 先b1
q.put((30,'c'))print(q.get())
print(q.get())
print(q.get())
'''
结果(数字越小优先级越高,优先级高的优先出队):
(10, 'b')
(10, 'b1')
(20, 'a')
(30, 'c')
'''
GIL不是python特点而是cpython解释器特点
(******)GIL会导致同一个进程下的多个线程无法同时执行,无法利用多核优势
from concurrent.futures import ThreadPoolExecutor, ProcessPoolExecutordef task(n, m):return n+mdef coll_back(res):print(res.result())if __name__ == '__main__':p_pool = ProcessPoolExecutor(3) # 最多几个进程同时执行for i in range(1,12):p_pool.submit(task, m=1, n=2).add_done_callback(coll_back) # 调用sumit,方法名 +参数
# from concurrent.futures import ThreadPoolExecutor,ProcessPoolExecutor
#
# def task(n,m):
# print(n)
# print(m)
#
# def coll_back(res):
# print(res)
#
# if __name__ == '__main__':
# p_pool=ProcessPoolExecutor(3) #最多几个进程同时执行
# p_pool.submit(task,m=1 ,n=2) #调用sumit,方法名 +参数
#
# p_pool.shutdown() #等同于join 子线程先执行完,再主线程
#
# print('end...')from concurrent.futures import ThreadPoolExecutor, ProcessPoolExecutordef task(n, m):return n+mdef coll_back(res):print(res.result())if __name__ == '__main__':p_pool = ProcessPoolExecutor(3) # 最多几个进程同时执行for i in range(1,12):p_pool.submit(task, m=1, n=2).add_done_callback(coll_back) # 调用sumit,方法名 +参数
协程:是单线程下的并发,又称微线程,纤程。英文名Coroutine。一句话说明什么是协程:协程是一种用户态的轻量级线程,即协程是由用户程序自己控制调度的。
python的线程属于内核级别的,即由操作系统控制调度(如单线程遇到io或执行时间过长就会被迫交出cpu执行权限,切换其他线程运行)
单线程内开启协程,一旦遇到io(消耗时间的比如time.sleep),就会从应用程序级别(而非操作系统)控制切换,以此来提升效率(!!!非io操作的切换与效率无关)
优点:
缺点如下:
总结协程特点:
附加:一个协程遇到IO操作自动切换到其它协程(如何实现检测IO,yield、greenlet都无法实现,就用到了gevent模块(select机制))
from greenlet import greenlet#Python学习交流群:711312441
def eat(name):print('%s吃了一会'%name)g2.switch(name)print('%s又吃了一会' % name)g2.switch()
def play(name):print('%s玩了一会'%name)g1.switch()print('%s又玩了一会' % name)g1=greenlet(eat)
g2=greenlet(play)g1.switch('z')
import gevent
def eat(name):print('%s eat 1' %name)gevent.sleep(2)print('%s eat 2' %name)def play(name):print('%s play 1' %name)gevent.sleep(1)print('%s play 2' %name)g1=gevent.spawn(eat,'z')
g2=gevent.spawn(play,name='z')
g1.join()
g2.join()