![]() ![]() ![]() ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT OF INTEREST FROM INVENTORS FOR SERIAL NO. PREVIOUSLY RECORDED ON REEL 017926 FRAME 0783. KG CORRECTIVE ASSIGNMENT TO CORRECT THE TO REMOVE INCORRECT SERIAL NO. KG reassignment QNX SOFTWARE SYSTEMS GMBH & CO. Assignors: BURGESS, COLIN, DANKO, ATTILLA, DODGE, DAN, MARINEAU-MES, SEBASTIEN, STECHER, BRIAN, VAN DER VEEN, PETER, FLETCHER, THOMAS Assigned to QNX SOFTWARE SYSTEMS GMBH & CO. KG ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Priority to US66207005P priority Critical Priority to US11/317,468 priority patent/US8434086B2/en Application filed by QNX Software Systems Ltd filed Critical QNX Software Systems Ltd Priority claimed from CA2538503A external-priority patent/CA2538503C/en Assigned to QNX SOFTWARE SYSTEMS GMBH & CO. Original Assignee QNX Software Systems Ltd Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.) ![]() ![]() ( en Inventor Dan Dodge Attilla Danko Sebastien Marineau-Mes Peter Van Der Veen Colin Burgess Thomas Fletcher Brian Stecher Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Active, expires Application number US11/317,468 Other versions US20070226739A1 Google Patents Process scheduler employing adaptive partitioning of process threadsĭownload PDF Info Publication number US8434086B2 US8434086B2 US11/317,468 US31746805A US8434086B2 US 8434086 B2 US8434086 B2 US 8434086B2 US 31746805 A US31746805 A US 31746805A US 8434086 B2 US8434086 B2 US 8434086B2 Authority US United States Prior art keywords thread processor threads adaptive adaptive partition Prior art date Legal status (The legal status is an assumption and is not a legal conclusion. Google Patents US8434086B2 - Process scheduler employing adaptive partitioning of process threads Mohanty, Debashree Nayak," A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis", International Journal of Computer Applications (0975 – 8887) Volume 5– No.5, August 2010.US8434086B2 - Process scheduler employing adaptive partitioning of process threads Matarneh," Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes", American Journal of Applied Sciences 6 (10): 1831-1837, 2009 ISSN 1546-9239 © 2009 Science Publications. Information Technology and Computer Science, 2013, 07, 56-62 Published Online June 2013 in MECS (). Ashkan Emami Ale Agha, Somayyeh Jafarali Jassbi," A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic-Arithmetic Mean (HARM)", I.J.Tarek Helmy, Abdelkader Dekdouk, "Burst Round Robin as a Proportional - Share Scheduling Algorithm", IEEEGCC.Taeck-Geun Kwon, Sook-Hyang Lee, and June-Kyung Rho, "Scheduling Algorithm for Real-Time Burst Traffic using Dynamic Weighted Round Robin", R&D Lab., LG Information & Communications, LTD., 1998 IEEE.Chhayanath Padhy, Dillip Ranjan Nayak, "Revamped Round Robin Scheduling Algorithm", Journal of Engineering Computers & Applied Sciences (JECAS) ISSN No: 2319-5606 Volume 3, No.4, April 2014.Ajit Singh, Priyanka Goyal, Sahil Batra, "An Optimized Round Robin Scheduling Algorithm for CPU Scheduling", International Journal on Computer Science and Engineering Vol.Roy, "Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice", International Journal of Computer Science and Communication Vol. Donelson Smith, Arun Moorthy, James Anderson, "Proportional Share Scheduling of Operating System Services for Real-Time Applications", In Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998. Principles of Operating System, Naresh Chauhan, Oxford University Press, 2014. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |