The first five tasks are created using the simple create_tasks function, which emulates processor-bound tasks (busy 90% of the time, sleep 10% of the time).
前五个任务使用简单的create _ tasks函数来创建,其模拟处理器绑定任务(90%的时间繁忙,10%的时间睡眠)。
The O(1) scheduler was much more scalable and incorporated interactivity metrics with numerous heuristics to determine whether tasks were I/O-bound or processor-bound.
O(1) 调度器扩展性更好而且包含交互性,提供了大量启示用于确定任务是受I/O 限制还是受处理器限制。
Essentially, any process or thread can be dispatched to run on any processor, except for processors or threads that are bound to run on a specific processor.
从本质上讲,任何进程或线程都可以分派到任意处理器上运行,但绑定在特定处理器上运行的处理器或线程除外。
Essentially, all the threads within the process can be bound to run on the specified processor.
从本质上讲,进程中的所有线程都可以绑定到指定的处理器上运行。
Generally speaking, you only need to use the NDK if your application is truly processor bound.
总的来说,只有当你的应用程序真的是个处理器杀手的时候你才需要使用NDK。
Once kernel threads of the process are bound, they'll always be scheduled to run on the selected processor.
在对进程的内核线程进行绑定之后,它们将会被调度运行于指定的处理器。
In a very simplistic situation where a user-base application is CPU bound, it would be ideal to create a matrix that compares processor allocation to a reasonable number of concurrent users.
在用户应用程序受限于CPU的情况下,建立一个基准比较处理器的分配和合理的并发用户数非常理想。
A CPU-bound application can't get enough processor time to complete the work it's being asked to do.
一个CPU关键型应用程序不能得到足够处理器时间来完成既定工作。
After compared with the XML and EXPRESS, the application principle and method of the data markup processor are presented using the late bound technology.
通过对比XML与EXPRESS语言之间的对应关系,应用后关联技术,研究了体系结构中的关键部分-信息标记处理器的实现原理与方法。
After compared with the XML and EXPRESS, the application principle and method of the data markup processor are presented using the late bound technology.
通过对比XML与EXPRESS语言之间的对应关系,应用后关联技术,研究了体系结构中的关键部分-信息标记处理器的实现原理与方法。
应用推荐