In exploring the efficacy of reconfigurable computing, one of the dimensions is the possibility for multitasking on an FPGA-based processor. Conventional computers and operating systems have demonstrated the many advantages of sharing computational hardware by several tasks over time. The ability to do run-time configuration and readback of FPGAs in a coprocessor architecture enables exploring ...

abstract this study was an attempt to investigate the effect of collaborative form-focused activities on grammar learning of elementary efl learners. to this end, 58 adult male iranian efl learners at elementary level of proficiency in three classes of language institutes were chosen. they formed the three groups of the study. the grammar section of cambridge michigan placement test was used to...

Fixed Priority Scheduling with Deferred Preemption (FPDS) offers a balance between Fixed Priority Non-preemptive Scheduling (FPNS) and Fixed Priority Preemptive Scheduling (FPPS), by allowing preemptions only at specified preemption points. It provides finer grained preemptions than FPNS, improving the schedulability of higher priority tasks, and a coarser grain preemptions than FPPS, reducing ...

A number of authors have recently suggested solving quasi birth-and-death (QBD) processes through the use of eigenvalue-based methods. These methods take on a special form when there are multiple eigenvalues present. We investigate this problem in a general setting as well as in the context of a specific preemptive priority queueing model.

We propose a logical justification for the rewriting-based equivalence procedure for simply-typed lambda-terms with sums of Lindley [Lin07]. It relies on maximally multi-focused proofs, a notion of canonical derivations introduced for linear logic. Lindley’s rewriting closely corresponds to preemptive rewriting [CMS08], a technical device used in the meta-theory of maximal multi-focus. 1998 ACM...

Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not received muc...