[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fWUFSHsd-d8CIzqgvFzGZB87wduCLVYW-gJG4i0h3sZA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2023-12-25 21:43:18",121568454,[8,9,10,11],"读取x存在数据依赖,不能并发进行","累加顺序被改变,结果是错误的","加法操作是简单运算,无需同步","加法操作不是原子操作,需要同步保证数据依赖",{"courseId":13,"courseImg":14,"courseName":15},"f3216a940ddb2a48ef903cdf7d98732e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","并行处理及分布式系统","多个线程进行并行求和,每个线程将自己负责的值依次读入局部变量x,累加到全局变量sum上,sum+=x,对此,下面说法正确的是 .( )",[18,30,39,48,57,66,74,82,91,94],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2023-12-25 21:43:17",121568371,[23,24,25,26],"是多源状态","加锁解锁开销低","条件不成立时阻塞线程并自动解锁加锁","以上皆错","条件变量相对于互斥量的优点是_____.( )","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],121568388,[34,35,36,37],"其结束时需程序员人为添加同步","其结束时OpenMP已默认添加隐式同步","其结束时完全不需要同步","其结束时必须进行同步","关于OpenMP程序中的并行结构,以下说法正确的是 .( )",{"answer":40,"createTime":5,"id":41,"options":42,"question":47,"source":28,"type":29},[],121568397,[43,44,45,46],"可能导致负载不均","通信开销高","任务粒度粗","计算复杂度高","动态任务划分相对于静态任务划分的缺点是____.( )",{"answer":49,"createTime":5,"id":50,"options":51,"question":56,"source":28,"type":29},[],121568404,[52,53,54,55],"外层存在,内层不存在","外层不存在,内层存在","两层都不存在","两层都存在","将冒泡排序程序改写为奇偶交换排序关于其两层循环是否存在数据依赖,下面说法正确的是()",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":28,"type":29},[],121568412,[61,62,63,64],"成本太高","结果不准确","时间太长","太危险","传统科学和工程实验相对于计算机并行仿真的劣势不包括()",{"answer":67,"createTime":5,"id":68,"options":69,"question":73,"source":28,"type":29},[],121568427,[70,71,72,26],"存在","不存在","不确定","for (i=2; i<10; i++) A[i] = A[i-2]+1; 此循环_____数据依赖.( )",{"answer":75,"createTime":5,"id":76,"options":77,"question":81,"source":28,"type":29},[],121568437,[78,79,80,26],"肯定快于","肯定慢于","可能快于","在编写使用n个线程进行n个数求和的OpenMP的程序时采用临界区技术,则多线程版本_____串行版本.( )",{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":28,"type":29},[],121568448,[86,87,88,89],"排列","交换","广播","归约","对矩阵乘法串行程序主体三重循环的最内层循环进行向量化,则该循环执行完毕后,还需进行SIMD寄存器中几个元素的 操作才能得到结果矩阵的一个元素.( )",{"answer":92,"createTime":5,"id":6,"options":93,"question":16,"source":28,"type":29},[],[8,9,10,11],{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":28,"type":29},[],121568460,[98,99,100,101],"MPI_Sendrecv","MPI_Send","MPI_Recv","MPI_Sendrecv_Replace","MPI原址收发各一条消息的API是()"]