نتایج جستجو برای: scheduling mechanisms

تعداد نتایج: 602802  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم ریاضی و مهندسی کامپیوتر 1392

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...

2012
N. Ramasubramanian

The theory of scheduling has expanded rapidly during the past years. As multi-core architectures begin to emerge, operating system issues are to be considered for best use of multi-core processes. Due to the architectural differences in the state of art multi-core processors such as shared caches, memory controllers etc., it becomes the responsibility of the operating system to make use of inte...

Journal: :Comput. J. 1995
Saurav Chatterjee Jay K. Strosnider

This paper describes the Distributed Pipeline Scheduling Framework that provides a systematic approach to designing distributed, heterogeneous realtime systems. This paper formalizes Distributed Pipelining Scheduling by providing a set of abstractions and transformations to map real-time applications to system resources, to create highly efficient and predictable systems, and to de-compose the ...

2011
Adam Grzech Piotr Rygielski

In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-toend network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic clas...

Journal: :journal of industrial engineering, international 2009
gh.r amin m.s hosseini shirvani

this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

Journal: :مهندسی برق و الکترونیک ایران 0
m. mollahassani-pour m. rashidinejad a. abdollahi s. nikbakhsh

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

2007
Arnoldo Díaz Ismael Ripoll Alfons Crespo

The application-defined scheduling model allows the implementation and use of different scheduling policies in a way compatible with the scheduling model defined in POSIX. The new scheduling policies are integrated into a real-time operating system without modifying its internal structure. In this paper, we discuss the application-defined scheduling model and propose some extensions to it. Part...

2011
Chakchai So-In Raj Jain Abdel Karim Al-Tamimi Tao Jiang Lingyang Song Yan Zhang

In this chapter, we focus on the management of resource allocation and scheduling in IEEE 802.16e based mobile WiMAX networks. Since mobile WiMAX uses orthogonal frequency division multiple access (OFDMA), the scheduling issues can apply for other OFDMA-based networks as well. Unlike wireless LANs, WiMAX networks incorporate several Quality of Service (QoS) mechanisms at the media access contro...

Ali Khosrozadeh ghomi Azadeh Divsalar Behnam Barzegar, Homayun Motameni

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Journal: :Performance Evaluation 2021

We investigate the performance of concurrency mechanisms available on NVIDIA’s new Ampere GPU microarchitecture under deep learning training and inference workloads. In contrast to previous studies that treat as a black box, we examine scheduling at microarchitectural level. find lack fine-grained preemption mechanisms, robust task prioritization options, contention-aware thread block placement...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید