Scheduling is a fundamental operating system function. Almost all computer resources are scheduled before use. All major CPU scheduling algorithms concentrates more on to maximize CPU utilization, throughput, waiting time and turnaround time. In particularly, the performance of round robin algorithm depends heavily on the size of the time quantum. To improve the performance of CPU and to minimi...

The POPCORN project provides an infrastructure for globally distributed computation over the whole Internet. It provides any programmer connected to the Internet with a single huge virtual parallel computer composed of all processors on the Internet, which care to participate at any given moment. POPCORN provides a market-based mechanism for trade in CPU time to motivate processors to provide t...

The ongoing research effort presented here aims at finding the most time-effective solver for reactive flow problems with strong volumetric expansion, and strong feedback effects of the reactions on the flow. This solver has to perform steady-state simulations of important chemical processes involving multiphase flow and detailed kinetics with minimal total CPU time requirements. This total CPU...

This paper describes a set of CPU usage analysis tools, named CPU Probes, with the benefits of both hardware and software tools, and few of their disadvantages. CPU probes use a serial line unit or programmable interval timer as a clock to sample the CPU usage of a system, resulting in fast and accurate CPU usage estimates. CPU usage can be monitored for all processes simultaneously or as littl...

A parallel-in-time, multiscale interaction procedure is introduced for systems described at molecular scales by time-dependent random variables that obey Langevin dynamics. At larger, kinetic scales, the system is described by a probability distribution function that obeys an associated Fokker-Planck equation. It is assumed that the main quantity of interest is the kinetic-scale probability dis...

This paper presents an implementation of scheduling abstractions originally developed for the Rialto real-time operating system within a research version of Windows NT called Rialto/NT. These abstractions, CPU Reservations and Time Constraints, as described in the 1997 SOSP paper [Jones et al. 97], are intended to allow: (1) activities to obtain minimum guaranteed execution rates with applicati...

Mesh simplification and mesh compression are important processes in computer graphics and scientific computing, as such contexts allow for a mesh which takes up less memory than the original mesh. Current simplification and compression algorithms do not take advantage of both the central processing unit (CPU) and the graphics processing unit (GPU). We propose three simplification algorithms, on...

With the development of synthetic aperture radar (SAR) technologies in recent years, the huge amount of remote sensing data brings challenges for real-time imaging processing. Therefore, high performance computing (HPC) methods have been presented to accelerate SAR imaging, especially the GPU based methods. In the classical GPU based imaging algorithm, GPU is employed to accelerate image proces...