Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks wit...

one of the major criticisms leveled at task-based language teaching (tblt), despite its countless merits, is developing fluency at the cost of accuracy. the post-task stage affords a number of options to counteract this downside through task repetition and task recycling. these two options are considered to positively affect learners' oral performance in terms of fluency, accuracy, and complexi...

background :according to numerous studies, fms-like tyrosine kinase 3, internal tandem duplication, and the d835 mutation are associated with a poor prognostic clinical outcome in acute myeloid leukemia patients. detection of the fms-like tyrosine kinase 3 mutation in patients who present with normal karyotype acute myeloid leukemia helps in both the understanding of the disease and the treatme...

0

Efficient task mapping and scheduling is a crucial factor for achieving high performance in multimedia wireless sensor networks. This paper presents Quality of Service (QoS) constrained task mapping and scheduling algorithm for multi-hop clustered wireless sensor networks. With the objective of meeting high performance and providing real-time guarantees, the algorithm simultaneously schedules t...

The existence of code cloning, which represents identical or near identical sections of code, has been documented to occur frequently in software systems. The main purpose of cloning is the reuse of a code fragment that performs some functionality by copying and pasting it to a new location in the source code. Code clones embody a unique form of coupling, because their similarity inadvertently ...

Task graph scheduling is the important factor which occurs in the multiprocessor system. There is problem solving technique called NP complete which is the optimal scheduling of parallel tasks with some precedence relationship onto parallel machines and can be solved only by using heuristic approach. The execution time requirements of the applications tasks are assumed to be stochastic. Genetic...

In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to...