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

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 0

a semi-empirical mathematical model for predicting physical part of ignition delay period in the combustion of direct - injection diesel engines with swirl is developed . this model based on a single droplet evaporation model . the governing equations , namely , equations of droplet motion , heat and mass transfer were solved simultaneously using a rung-kutta step by step unmerical method . the...

Sama Ahmadpour Vahidreza Ghezavati

In this study, we aim to present a new model for the resource-constrained project scheduling problem (RCPSP) considering a working calendar for project members and determined the skill factor of any member using the efficiency concept. For this purpose, the recyclable resources are staff resources where any person with multiple skills can meet the required skills of activities in a given time. ...

1996
Tae-Young Choe Chan-Ik Park Chan-Mo Park Byung-Seop Kim

Real-time applications require an eficient scheduler supporting multiple priority levels and fast preemption. In this paper, we propose a scheduler based on the hardware-supported scheduler of transputers, Though the hardware-supported scheduler of transputers is very eficient in terms of scheduling overhead, it should be extended to support multiple priority levels and fast preemption in order...

2014
Wen Chen Haixiang Yu Wenbing Feng

In heterogeneous wireless network environment (HWNE), multi-mode terminals through access control and handoff technology, are always in the optimal network. However, when the users set, while a competition optimal network bandwidth limited, easily lead to network congestion and quality of service (QoS) decrease. To solve this problem, this paper configures QoS policies for heterogeneous network...

2006
Xiaojun Lin

In this paper we study the problem of characterizing the delay performance of wireless scheduling algorithms. In wireless networks operated under these wireless scheduling algorithms, there often exists a tight coupling between the service-rate process, the system backlog process, the arrival process and the channel variations. Although one can use sample-path large-deviation techniques to form...

2004
Herve Moulin

If shortest jobs are served first, splitting a long job into smaller jobs reported under different aliases, will reduce the actual wait until completion. If longest jobs are served first, the dual maneuver of merging several jobs under a single reported identity is profitable. Both manipulations can be avoided if the scheduling order is random, and users care only about the expected wait until ...

2014
P. G. Scholar

There are many routing strategies for message delivery in Delay Tolerant Networks. Among them Multicopying routing strategies have been considered the most applicable DTNs. Epidemic routing and two-hop forwarding routing are the two best approaches of DTN. These two approaches belong to multicopying routing strategies as they allow multiple message replicas to increase message delivery delay. T...

Journal: :JCP 2013
Xiangjie Ma Xiaozhong Li Xinglong Fan

In this paper, the service guaranteed scheduling model was proposed for the MPMS switching fabric. Firstly, the service distribution characteristic of each cell flow was analyzed in the MPMS switching fabric. Then, the service guaranteed distributed architecture was designed, and the scheduling model is proposed for demultiplexors, multiplexors, input switching units, middle switching units and...

2013
D. Vinayagam A. Sagaya Selvaraj A. Jayakumar S. Radhakrishnan

The proposed algorithm prolongs the scheduler from scheduling the Real Time (RT) and Non Real Time (NRT) services based upon their priority required on Quality of Service (QoS). The proposed Cross QoS Scheduling Algorithm (XQSA) is capable of scheduling data, video and voice services over the same wireless channel. The complimentary advantages of both RT (video & voice) and NRT (Best Effort of ...

2001
Hwa-Chun Lin Chun-Hsin Wang

This paper shows that, for single-hop WDM networks, a multicast scheduling algorithm which always tries to partition a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than a multicast scheduling algorithm which does not partition multicast transmissions. The performance of a multicast scheduling algorithm may depend on the t...

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

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