The majority of the studies conducted in scheduling real-time transactions mostly concentrate on concurrency control protocols, while overlooking the CPU as being the primary resource. Consequently, there are various techniques for scheduling the CPU in conventional time-critical systems; meanwhile, there does not seem to be any technique that is adequately designed for scheduling such a resour...

This paper proposes a fast rendering algorithm for real-time animation of large crowds, which is essential for video games with a large number of non-player characters. The proposed approach leaves the minimal work of rendering to CPU, and makes GPU take all the major work, including LOD assignment and view frustum culling, which have been the typical tasks of CPU. By offloading the rendering o...

CPU Scheduling is the base of multiprogramming. Scheduling is a process which decides order of task from a set of multiple tasks that are ready to execute. There are number of CPU scheduling algorithms available, but it is very difficult task to decide which one is better. This paper discusses the design and implementation of modified fuzzy based CPU scheduling algorithm. This paper present a n...

The CPU scheduling is one of the most important tasks of the operating system. Many algorithms are designed and used in this regard each having advantages and disadvantages. In this paper a new algorithm for the CPU scheduling is presented using FFGA (Fonseca and Fleming’s Genetic Algorithm) multiobjective optimization. Contrary to the classical algorithms in use, it uses the three parameters o...

The algorithm developed by Razinger et al. for the automorphism group of a graph is significantly improved by eliminating the CPU-intensive n3 matrix multiplication operations. The CPU times of the two algorithms are compared. The new algorithm based on memory manipulation reduces the required CPU time for some graphs by a factor of-3350. For example, the new algorithm took 1 min, 29 s of CPU t...

As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this paper, we propose an algorithm, the Greedy Miser, that incorporates the feat...

normal 0 false false false en-us x-none ar-sa digital breast tomosynthesis (dbt) is a technology that creates three dimensional (3d) images of breast tissue. tomosynthesis mammography detects lesions that are not detectable with other imaging systems. if image reconstruction time is in the order of seconds, we can use tomosynthesis systems to perform tomosynthesis-guided interventional procedur...

In Robotics, especially in this era of autonomous driving, mapping is one key ability of a robot to be able to navigate through an environment, localize on it and analyze its traversability. To allow for real-time execution on constrained hardware, the map usually estimated by feature-based or semidense SLAM algorithms is a sparse point cloud; a richer and more complete representation of the en...