Filters








12,594 Hits in 7.2 sec

Bayesian Functional Optimisation with Shape Prior

Pratibha Vellanki, Santu Rana, Sunil Gupta, David Rubin de Celis Leal, Alessandra Sutti, Murray Height, Svetha Venkatesh
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We demonstrate the effectiveness of our approach for short polymer fibre design and optimising learning rate schedules for deep networks.  ...  We represent the control function using Bernstein polynomial basis and optimise in the coefficient space.  ...  We applied our algorithm for learning rate schedule optimisation and found that an optimised learning rate schedule can even make SGD to perform better than both the method proposed by (Vien, Zimmermann  ... 
doi:10.1609/aaai.v33i01.33011617 fatcat:3eifdyc3wfepdfj43biqlnwfym

Bayesian functional optimisation with shape prior [article]

Pratibha Vellanki, Santu Rana, Sunil Gupta, David Rubin de Celis Leal, Alessandra Sutti, Murray Height, Svetha Venkatesh
2020 arXiv   pre-print
We demonstrate the effectiveness of our approach for short polymer fibre design and optimising learning rate schedules for deep networks.  ...  We represent the control function using Bernstein polynomial basis and optimise in the coefficient space.  ...  We apply our algorithm for learning rate schedule optimisation and found that an optimised learning rate schedule can even make SGD to perform better than both the method proposed by (Vien, Zimmermann  ... 
arXiv:1809.07260v2 fatcat:yreg3cb75bcwxhe77cmecy7a64

Hardware-software co-synthesis of hard real-time systems with reconfigurable FPGAs

Faridah M. Ali, A. Shoba Das
2004 Computers & electrical engineering  
The proposed co-synthesis algorithm integrates partitioning and nonpreemptive scheduling. Reconfigurable FPGAs are incrementally added when schedulability suffers in a uniprocessor system.  ...  Real-time systems cover a wide application domain.  ...  In both approaches [8, 9] , initial scheduling in software is done by rate monotonic scheduling algorithm, which is optimal for the class of tasks which are independent and periodic, where task dependency  ... 
doi:10.1016/j.compeleceng.2004.09.001 fatcat:4ew7xumx7nd33dl2n6hj3ucaeq

Multiple time scale congestion control for self-similar network traffic

Tsunyi Tuan, Kihong Park
1999 Performance evaluation (Print)  
In this paper, we study congestion control algorithms for improving network performance|in particular, throughput|under self-similar trac conditions.  ...  We show that cooperative interaction between the two congestion control modules acting on information at dierent time scales leads to improved performance visa-vis the case when the large time scale component  ...  As expected, for the threshold schedule, packet loss rate increases monotonically as the aggressiveness threshold is increased.  ... 
doi:10.1016/s0166-5316(99)00024-3 fatcat:pud6awhkdre65bkhzvdu4egtte

Cross layer dynamic resource allocation with targeted throughput for WCDMA data

Peifang Zhang, Scott Jordan
2008 IEEE Transactions on Wireless Communications  
We construct a framework for connection access control and rate scheduling that supports this class of applications by maximizing long term average utility.  ...  We present a decomposition of the problem into connection access control and rate scheduling layers.  ...  [21] ) may improve the performance. Finally we compare the utility assisted CAC to a non-utility based variant, using the same rate scheduler.  ... 
doi:10.1109/t-wc.2008.070312 fatcat:7qdadmfwifaqzg6e32qihciqsy

Rate Monotonic Analysis for Real-Time Systems [chapter]

Lui Sha, Mark H. Klein, John B. Goodenough
1991 Foundations of Real-Time Computing: Scheduling and Resource Management  
The essential goal of the Rate Monotonic Analysis (RMA) for Real-Time Systems Project at the Software Engineering Institute is to catalyze improvement in the practice of real-time systems engineering,  ...  specifically by increasing the use of rate monotonic analysis and scheduling algorithms.  ...  Introduction 1 The essential goal of the Rate Monotonic Analysis for Real-Time Systems (RMARTS) Project at the Software Engineering Institute (SEI) is to catalyze an improvement in the state of the  ... 
doi:10.1007/978-1-4615-3956-8_5 fatcat:drizskktazaxvlaeri6ummfjna

Perfect simulation of index based routing queueing networks

Jean-Marc Vincent, Jérôme Vienne
2006 Performance Evaluation Review  
Monotonicity of indexes implies the monotonicity of the global dynamic which improves deeply the simulation time.  ...  Introduction Markovian queueing networks models are widely used for performance evaluation of computer systems, production lines, communication networks and so on.  ... 
doi:10.1145/1168134.1168146 fatcat:3tygwcjxvncmzn6kxxb3zv7r4i

Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

S. Ewins Pon Pushpa, Manamalli Devasigamani
2014 Modelling and Simulation in Engineering  
The obtained task set possesses the advantage of Rate Monotonic Algorithm and Shortest Job First priority scheme.  ...  Given the computation times, this paper proposes two utilization bound algorithms to derive interrelease times for nonpreemptive periodic tasks, using a new priority scheme, "Rate Monotonic Algorithm-Shortest  ...  condition of quadratic time-complexity for NP-FP, which has significant performance improvement comparing to the first one.  ... 
doi:10.1155/2014/705929 fatcat:nxghmrreybeebc5yj3b27jzem4

On Resource Overbooking in an Unmanned Aerial Vehicle

D. D. Niz, L. Wrage, N. Storer, A. Rowe, R. Rajkumar
2012 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems  
We perform a detailed evaluation of our approach on our UAV system to clearly demonstrate its benefits.  ...  For example, variations arise in the case of visual object-tracking tasks, whose execution times depend on the contents of the current field of view of the camera.  ...  Zero-Slack Rate-Monotonic scheduling (ZSRM) is one of these approaches [1] . ZSRM is a general fixed-priority preemptive scheduling policy that is defined for a uniprocessor system.  ... 
doi:10.1109/iccps.2012.18 dblp:conf/iccps/NizWSRR12 fatcat:ybt2hcfyarbnfpswp3lwy5u6he

Reliability-Driven Scheduling of Periodic Tasks in Heterogeneous Real-Time Systems

Wei Luo, Xiao Qin, Kiranmai Bellam
2007 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)  
In this paper we comprehensively investigated the issue of reliability-driven real-time scheduling for periodic tasks in heterogeneous systems.  ...  Next, we proposed a novel reliabilitydriven scheduling algorithm (referred to as Repars) for periodic tasks in heterogeneous systems.  ...  To reveal performance improvements gained by our proposed algorithms, we first compare the Repars with the well-known scheduling algorithms, namely, RMFF (Rate-Monotonic First-fit) [11] .  ... 
doi:10.1109/ainaw.2007.311 dblp:conf/aina/LuoQB07 fatcat:pikrnpimf5hu3f4mq57bwzi4bq

Optimal buffer partitioning on a multiuser wireless link

Omur Ozel, Elif Uysal-Biyikoglu, Tolga Girici
2010 2010 Information Theory and Applications Workshop (ITA)  
The improvement brought by optimal buffer allocation to scheduling based solely on channel-state is explored.  ...  Then, a multichannel extension of this system is considered when the users have different arrival rates and channels have different outage probabilities.  ...  With a limited memory space, buffer management is necessary for maximum performance in such a multiuser system.  ... 
doi:10.1109/ita.2010.5454079 dblp:conf/ita/OzelUG10 fatcat:5tdtjkg2grgmjkjd5dt4lfufiy

Optimal Buffer Partitioning on a Multiuser Wireless Link

Ömur ÖZEL, Elif UYSAL-BIYIKOGLU, Tolga GIRICI
2011 IEICE transactions on communications  
The improvement brought by optimal buffer allocation to scheduling based solely on channel-state is explored.  ...  Then, a multichannel extension of this system is considered when the users have different arrival rates and channels have different outage probabilities.  ...  With a limited memory space, buffer management is necessary for maximum performance in such a multiuser system.  ... 
doi:10.1587/transcom.e94.b.3399 fatcat:mockyy2vszaqxnuwuelcueqm3y

Efficient online schedulability tests for real-time systems

Tei-Wei Kuo, Li-Pin Chang, Yu-Hua Liu, Kwei-Jay Lin
2003 IEEE Transactions on Software Engineering  
Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs.  ...  Moreover, the tests can be done incrementally as each new task arrives at the system.  ...  process service rates in most real-time system are often chosen from a small collection of values to simplify the system design and to improve the system performance.  ... 
doi:10.1109/tse.2003.1223647 fatcat:ckeevfejv5gvhokzbktpoy3tum

Comprehensive Comparison of Schedulability Tests for Uniprocessor Rate-Monotonic Scheduling

Arnoldo Díaz-Ramírez, Pedro Mejía-Alvarez, Luis E. Leyva-del-Foyo
2013 Journal of Applied Research and Technology  
In this paper, a performance analysis is conducted for the best-known real-time schedulability conditions that can be used in online admission control on uni-processor systems executing under the Rate-Monotonic  ...  The goal of this paper is to provide guidelines for system designers in order to decide which schedulability condition provides better performance under different task characteristics.  ...  rate-monotonic first-fit.  ... 
doi:10.1016/s1665-6423(13)71551-7 fatcat:w2x5zbr6xba4hmuodzpykgjixm

Enhanced aperiodic responsiveness by multi budget bandwidth preserving server

Ranvijay, Rama Shankar Yadav, Smriti Agrawal
2010 ACM SIGBED Review  
Feasibility analysis is done at offline by assigning the priority of periodic tasks as well as server to service the aperiodic tasks by fixed priority rate monotonic first algorithm.  ...  This paper presents multi budget bandwidth preserving server (MBBPS) to improve the quality of service in terms of better responsiveness of the aperiodic task by utilizing the concept of multi budget and  ...  Full guarantee for periodic tasks are gives using offline rate monotonic first [2] , deadline monotonic first [2] over the full guarantee assigned to periodic tasks, aperiodic tasks are scheduled at  ... 
doi:10.1145/1850820.1850821 fatcat:kghvttvfbrbtxa6dxgvh56d7by
« Previous Showing results 1 — 15 out of 12,594 results