The loads of the transaction and report partitions crystallize the very need for dynamic processor allocation.
事务和报表分区的负载明确指出非常需要进行动态处理器分配。
In this thesis we propose three new data flow models: a time series communication model, a processor allocation model and a new data flow architecture.
本文提出了几个新的数据流模型：时序通信模型、有限资源条件下的处理器分配模型和一种结合数据流与控制流的机器模型。
Analyzed is up-down algorithm, a heuristic processor allocation algorithm, and improvement of this algorithm is proposed, it shortens mean time to respond.
增减算法是一种启发式的处理机分配算法。对增减算法进行了分析，然后在此基础上对该算法进行了改进，缩短了平均响应时间。
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的情况下，建立一个基准比较处理器的分配和合理的并发用户数非常理想。
Each thread (not processor) has a thread Local allocation Buffer (TLAB) so that object allocation is cheap and thread-safe.
每一个线程(不处理)有一个线程本地分配缓冲区(TLAB)，分配对象是廉价的，线程安全的。
Each thread (not processor) has a thread Local allocation Buffer (TLAB) so that object allocation is cheap and thread-safe.
每一个线程(不处理)有一个线程本地分配缓冲区(TLAB)，分配对象是廉价的，线程安全的。
应用推荐