Filters








818,215 Hits in 4.1 sec

A two-competitive approximate schedulability analysis of CAN

Bjorn Andersson, Nuno Pereira, Eduardo Tovar
2007 2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)  
The previous example show that the schedulability analysis used in Theorem 1 is not tight. It then natural to ask how much pessimism it causes. Theorem 2 answers that question. Theorem 2.  ...  With the exact analysis (1)-(7) we obtain R 1 =180, R 2 =270, R 3 =270. But with the analysis of Theorem 1 we obtain: R 1 ≤ 180, R 2 ≤ 418, R 3 ≤ 813.  ... 
doi:10.1109/efta.2007.4416947 dblp:conf/etfa/AnderssonPT07a fatcat:po6jwqgvc5cmtcjxy64nittg3y

Fuzzy system models for aggregate scheduling analysis

I.B. Türksen, M.H. Fazel Zarandi
1998 International Journal of Approximate Reasoning  
Aggregate scheduling system analysis is presented in order to bring to the surface the hidden rules of an operating scheduling system.  ...  The purpose of this paper is not to determine optimal detailed scheduling sequences: but rather to investigate and analyse complex fuzzy interactions of variables affecting a scheduling system and its  ...  Naturally one would ask whether such aggregate scheduling system models might not be developed by classical statistical partitioning methods such as principle component analysis, multiple regression analysis  ... 
doi:10.1016/s0888-613x(98)10003-8 fatcat:z3g4ocradneqhg6kwtyjgdaose

Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks

Keqin Li
1999 Discrete Mathematics & Theoretical Computer Science  
We propose and analyze a simple approximation algorithm called H_m, where m is a positive integer.  ...  International audience In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors.  ...  We proposed a simple approximation algorithm called ➏ ★ ➐ , and performed combinatorial analysis for its worst-case performance and probabilistic analysis for its average-case performance.  ... 
doi:10.46298/dmtcs.262 fatcat:bkqxl2dvuvd6lnjxnmhffm2uga

Analysis and approximation of optimal co-scheduling on chip multiprocessors

Yunlian Jiang, Xipeng Shen, Jie Chen, Rahul Tripathi
2008 Proceedings of the 17th international conference on Parallel architectures and compilation techniques - PACT '08  
Solving the question is critical for determining the potential of a co-scheduling system. This paper presents a theoretical analysis of the complexity of co-scheduling, proving its NPcompleteness.  ...  For more complex cases, we design and evaluate a sequence of approximation algorithms, among which, the hierarchical matching algorithm produces near-optimal schedules and shows good scalability.  ...  Approximation with Local Optimization A detailed analysis shows that the local optimization improves the performance of 7 programs, including the drastic improvement on equake, gap, and mcf.  ... 
doi:10.1145/1454115.1454146 dblp:conf/IEEEpact/JiangSCT08 fatcat:6yrkp3ubuvghnfdvrbfingsyte

Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding [chapter]

Omer H. Abdelrahman, Erol Gelenbe
2009 Lecture Notes in Computer Science  
The model is analyzed approximately using a decoupling approach, and can be used to predict the additional delays incurred by packets in nodes that use NC.  ...  We propose a round robin scheduling scheme for serving these disjoint subsets, and present a queueing model for a single encoding node that captures the effect of NC.  ...  Conclusions In this paper, a round robin scheduling scheme based on NC has been proposed and analyzed approximately.  ... 
doi:10.1007/978-3-642-02924-0_17 fatcat:3uiumzt6sfex5lkz63jfx5i7uu

Delay analysis of the approximate maximum weight scheduling in wireless networks

Cem Boyaci, Ye Xia
2013 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC)  
We provide bounds for the expectations of the stationary delay and the sum of the stationary queue sizes under the approximate maximum weight scheduling (MWS) policy and under the longest-queue-first (  ...  Index Terms-wireless link scheduling; maximum weight schedule; longest-queue-first schedule; stability; queue size; delay • We provide bounds for the expectations of the stationary delay and the sum of  ...  Note that the approximation ratio in Lemma 4 depends on n, whereas the approximation ratio in Corollary 2, which is for the LQF schedule, does not.  ... 
doi:10.1109/iwcmc.2013.6583532 dblp:conf/iwcmc/Boyaci013 fatcat:y7b44gs7pjetro46znd3lcj7pu

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang
2016 Journal of Scheduling  
In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime optimal schedules, called LD algorithm,  ...  We will use case analysis to cover all possible LD schedules. For all cases we will have λ 1 ≥ α 1 ≥ λ 2 ≥ α 2 ≥ λ 3 > 0. This results in the following 5 constraints.  ...  It follows from Graham's original analysis of LPT list scheduling that n ≤ 2m case is clear. Proposition 2. The Coffman-Sethi conjecture holds for every m and n such that n ≤ 2m (i.e., k ≤ 2).  ... 
doi:10.1007/s10951-015-0467-4 fatcat:pn4ptiwfkvhltggntsd6ucufiq

On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems

Christian Gunia
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
In this paper we analyze the behavior of two very simple search heuristics on a strongly NP-hard scheduling problem.  ...  Although both find feasible solutions in pseudo-polynomial time, at least one of them is not able to present an (1 + ε)-approximation for arbitrary ε > 0 with constant probability.  ...  In 1966 Graham [7] introduced the probably first worst-case analysis of an approximation algorithm by proving that his list scheduling algorithm obtains a solution in polynomial time, guaranteeing a  ... 
doi:10.1145/1068009.1068106 dblp:conf/gecco/Gunia05 fatcat:7r5tuk2tyjbrdo3uueum4r543e

Approximate Performance analysis for the Double Servers in the Asynchronous Schedule Mechanism of Polling

Li-yong BAO, Dong-feng ZHAO, Yi-fan ZHAO
2012 International Journal of Education and Management Engineering  
This thesis provides the schedule strategy in the asynchronous mechanism of multiqueue double servers polling, which is conducted based on theory of polling multi-access and simulation experiments on computer  ...  Approximate analysis is conducted based on queuing theory [6] .  ...  At present the main way to solve the problem lies with an approximate analysis method. It is expected to find out the effective analytical method in this research.  ... 
doi:10.5815/ijeme.2012.09.02 fatcat:m3utev2zobhqnpinrgfzbnll6u

Optimizing Power-Water-Heat Flows via Decomposed Iterative Convex Approximation [article]

Sidun Fang, Chenxu Wang, Yashen Lin, Changhong Zhao
2021 arXiv   pre-print
Literature verified improvement in operational flexibility and economic benefits achieved by joint scheduling of powerheat networks [3] , [4] and power-water networks [5] , [6] .  ...  First, OPWHF is approximated with convex relaxation and convex-concave procedure.  ... 
arXiv:2102.00688v1 fatcat:pr7ywndykvfirlqmkhrjwirhqq

PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
最大納期遅れを最小にする1機械処理順序問題に対する6種の近似解法の評価 : 準備時間のある場合

Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine
1979 Journal of the Operations Research Society of Japan  
This suggests that the quality of approximate schedules is not affected by the magnttude of P, Rmax, Dmin, but rather determined by their ratios.  ...  We conclude that Algorithm mS is efficient and gives good approximate solutions for the one maehine scheduling problern discussed here. It ean be recorrrrnended for practical uses.  ... 
doi:10.15807/jorsj.22.205 fatcat:4p34ld74wndapixeeqk3dk74te

Approximate schedulability analysis

S. Chakraborty, S. Kunzli, L. Thiele
23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.  
We show that this concept of approximate schedulability analysis is fairly general and can be applied to any task model which satisfies certain "taskindependence" assumptions.  ...  The schedulability analysis problem for many realistic task models is intractable.  ...  A Framework for Approximate Schedulability Analysis In its most general form, our framework for approximate schedulability analysis relies on the following two building blocks (see Figure 1 ).  ... 
doi:10.1109/real.2002.1181571 dblp:conf/rtss/ChakrabortyKT02 fatcat:n4cpvizo3jdxrctbxhku2zjfay

Analysis And Approximation Of Optimal Co-Scheduling On Cmp

Yunlian Jiang
2011
processes co-runnmg on a shared cache Th1s d1ssertat1on explores the mfluence on co-run performance pred1ctron rmposed by co-runners, program mputs, and cache conf1gurat1ons Through a sequence of formal analysis  ...  co-run locality model, uncovenng the mherent stat1st1cal connect1ons between the data references of programs s1ngle-runs and the1r co-run locality The model offers theoretical ms1ghts on co-run locality analysis  ...  The two approximation algorithms use even less time for scheduling.  ... 
doi:10.21220/s2-tjmj-8k82 fatcat:hwp42a5fc5capj4ljksc2czjyu

Worst-Case Analysis of an Approximation Algorithm for Single Machine Scheduling Problem

Natalia Grigoreva
2021 Proceedings of the 16th Conference on Computer Science and Intelligence Systems   unpublished
The problem of minimizing the maximum delivery times while scheduling jobs on the single processor is a classical combinatorial optimization problem.  ...  Such algorithms should have a good approximation ratio and the low computational complexity. One of the popular scheduling tools are list algorithms that build non-delayed schedules.  ...  The theoretical analysis of the algorithms shows that the most difficult examples take place when there are one or two long jobs. Such tests were generated in groups of type B and type C.  ... 
doi:10.15439/2021f66 fatcat:opqdzw7pmfaevfhlhcy6uc7bca

Page 2021 of The Journal of the Operational Research Society Vol. 60, Issue Supplement 1 [page]

2009 The Journal of the Operational Research Society  
The performance of an approximation algorithm is evalu- ated by either worst-case analysis or probabilistic analysis of and VA Strusevich—Fifty years of scheduling S53 its behaviour.  ...  Single machine and parallel machines Worst-case analysis of scheduling approximation algorithms was origi- nated by Graham (1966, 1969).  ... 
« Previous Showing results 1 — 15 out of 818,215 results