Priority based computation: "An Initial study result of paradigm shift on real time computation"

Sukemi Sukemi; Riyanto Riyanto

doi:10.18495/comengapp.v6i1.198

[1] Sukemi,Ratna AAP., Sudibyo H,“Priority based computation: A Study of paradigm shift on real time computation,”Computational Intelegence and Cybernetics (Cyberneticscom), 2012 IEEE International Conference on DigitalObject Identifier, 12-14 Juli 2012, Bali, Indonesia.pp. 129-132, 2012.
[2] Stankovic, J.A., Spuri, M. danRamamritham, K.,“Deadline cheduling for Real-Time Systems : EDF and Related Algorithms,”Kluwer Academic Publishers(Kluwer International Series in Engineering andComputerScience), 1998.
[3] Sukemi, Ratna A.A.P, Sudibyo H, “Variable Bitspace of Variable Precision Processor,”Journal of Advanced in Information Technology,pp.65-70, 2014.
[4] Sukemi, Ratna A.A.P, Sudibyo H, “Development of an arithmetic unit bitspace architecture real-time for optimum performance,” TheBook‘3’ part of dissertation,examined on Mei 2016, Electrical Departemen, University of Indonesia, Depok, Indonesia, 2016.
[5] Sukemi,Ratna A.A.P, Sudibyo H,“Variable Bitspace Architecture with Variable Precision Processor,”The 2013 Annual International Conference on Advances Technology in Telecomunication, Broadcasting, and Satellite (TelSaTech 2013),2-3 Agustus 2013, Jakarta,Indonesia. Adv. Sci. Lett. 20, pp. 531-533, 2014.
[6] Lehoczky,J.,Sha, L. dan Ding, Y.,“The Rate Monotonic Scheduling Algorithm:Exact Characterization And. Average Case Behavior,”Proceedings of Real Time Systems Symposium, pp. 166-171, 1989.
[7] Parks, T.M. dan Lee, E.A.,“Non-Preemptive Real-Time Scheduling of Dataflow Systems,”IEEE International Conference on Acoustics,Speech, and SignalProcessing, 1995.
[8] Dey, J.K., Kurose,James, F. dan Towsley, D., “Efficient on-line processor scheduling for a class of IRIS(increasing reward with increasing service)real-time tasks,”Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pp. 217-228, 1993.
[9] Liu, J.W.S,Shih, W.K., dan Lin, K.J., “Imprecise Computations,”Proceedings of the IEEE. 82 (1), 1991.
[10] Mora-Mora, H., Mora-Pascual, J. dan Garcia-Chamizo, J.M.,“Real-Time Arithmetic Unit,”Real-Time Systems,34 , pp. 53-79, 2006
[11] Kerlooza, Y,K., Gondokaryono, Y,S., and Mulyana, A.,“MSB-First Interval-Bounded Variable-Precision Real Time Arithmatic Unit,”ICT Journal, ITB,2010.
[12] Jeffay, K., Stanat, D.F., Martel dan C.U.,“On Non-Preemptive Scheduling of Periodic and Sporadic Tasks,”Proceedings of the 12th Real-Time Systems Symposium, 1991.
[13] wikipedia.org, “time driven programming”,http://en.wikipedia.org/wiki/Time-driven_programming, 2014.
[14] JensenED., Locke CD., Tokuda H., “A-time-driven scheduling model for Real Time Operating Systems”,IEEE CH2220-2/b5/0000/0112$01.00, 1985.
[15] Nielsen, asger Munk,Kornerup,Peter,“MSB-First Digital serial arithmatic,”Journal of Universal Computer science, 1(7), 1995.
[16] David J. Kinnement, “Synchronization and Arbitration in Digital System,”John Wiley., ISBN 978-0470-51082-7, 2007.
[17] Zadeh, Lotfi A, “Fuzzy logic, Neural Network, and soft computing,”communication of the ACM, 1994.
[18] Schulte, M.J.. “A Variable-Precision,Interval Arithmetic Processor,”PhD thesis University of Texas, 1996.
[19] Hormigo, J., Villalba, J. dan Schulte, M.J.,“A Hardware Algorithm for Variable-Precision Logarithm,”Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures,and Processors,2000.
[20] Tinder, R.F.,“Engineering Digital Design,”2. ed. San Diego, USA: AcademicPress.—ISBN: 0-12-691295-5, 2000.

Abstract viewed - 1183 times
PDF downloaded - 1142 times

Affiliations

Sukemi Sukemi
Universitas Sriwijaya

Riyanto Riyanto
Technology and Innovation Centers Division (PUSTEKIN)

Content Top

Priority based computation: "An Initial study result of paradigm shift on real time computation"

Sukemi Sukemi ,
Riyanto Riyanto

Vol 6 No 1 (2017)

DOI 10.18495/comengapp.v6i1.198

Submitted: Mar 16, 2017

Published: Feb 27, 2017

Abstract

This research is purposed to increase computer function into a time driven to support real time system. This purposed would the processor can work according to determined time variable and can work optimally in a certained deadline. The first approachment to design some of processor that has a different bit space 64, 32, 16 and 8 bits. Each processor will be separated by selector/arbiter priority of a task. In addition, the design of the above processors are designed as a counter with varying levels of accuracy (variable precision computing). The selection is also done by using statistical control in the task are observed by the appearance of controller mounted on the front of the architecture bit space the second approach above. The last approach to â€˜addâ€™ certainty in the form of interval arithmetic precision cutting task that can be the upper bound and lower bound of the area (bounds).
These four approachment can be structured orthogonally into a processor/several processors by introducing a new classifier that serves as a selector or a task arbiter. The results of the four approaches to prove that the processor is prepared by incorporating a variable bitspace adder selectors can provide optimality of 0.43%.