Sentence examples for balanced tasks from inspiring English sources

As shown in Fig. 4 c, there are two intermittent stable states, where a relatively balanced tasks assignment could be achieved.

From (2) one queue of balanced tasks (B q ) is created with the following equation: (3) B q = ∑ (S g ).

The Create Queue activity produces a number of queues of balanced tasks during FReMI run time based on the information from wFReDoW control file.

Basically, the FReMI Execution identifies the active snapshots (status A), inserts them in queues of balanced tasks that are created based on subgroup priorities emerging from the P-SaMI data pattern, and submits these queues into the HPC environment.

The number of tasks executed per instance was 32 (from (1): T = 32), and the size of the queues of balanced tasks ranged according to the number of instances used.

As the processing of each read (or paired reads for pair-end input data) is independent, Meta-QC-Chain appoints weighted and balanced tasks, each including a suitable number of reads (which is dependent on both the total read number and the assigned CPU core number), to different threads, then processes different CPU cores simultaneously and in parallel.

Based on game theory, the task scheduling algorithm considering the reliability of the balanced task is proposed.

Based on hierarchical iteration tree, this paper gives a reasonable improvement of arborous BGP division scheme, which has the advantages of balanced task division and low communication cost.

This paper present methods for controlling the complexity of user-centered evaluations of search user interfaces through within-subjects designs, balanced task sets, time limitations, pre-formulated queries, cached result pages, and through limiting the users' access to result documents.

In future work, social relationship can be explored and exploited for semi-cooperative design, where balanced task offloading could be performed among friends, and unfamiliar mobile users, and plays an important role for task execution efficiency.

The reason is, due to the extremely short round length, users could not migrate their tasks sufficiently, i.e., from dynamic allocation to stable Nash equilibrium, where the balanced task allocation could not be achieved.