TY - GEN
T1 - Priority based computation
T2 - 2012 1st IEEE International Conference on Computational Intelligence and Cybernetics, CyberneticsCom 2012
AU - Sukemi,
AU - S., Harry Sudibyo
AU - Ratna, Anak Agung Putri
PY - 2012
Y1 - 2012
N2 - This research is purposed to increase computer function into a time driven to support real time system so that the processor can work according to determined time variable and can work optimally in a certained deadline. The first approachment of this research is a processor which has a priority arbiter/border of a task. The second approachment, is a numerator processor with variable precision (VP) computing. The third approachment is by functioning statistic control of the emergence task that will be observing with the help of coprocessor which is placed in the front section of bitspace architecture of the second approachment above. The last aprroachment is by adding certainty precision in form of arithmetic interval that is able to cut the data/task. The data/task-cut is in the form of upper and lower border from the bounds. These four approachments can be structured orthoganally or stand alone into a processor/several processors. Initial hyphothesis of these four approachments can produce a processor that can work optimally in time variable and in a fast, accurate, reliable and robust daedline in supporting real time data/task finishing.
AB - This research is purposed to increase computer function into a time driven to support real time system so that the processor can work according to determined time variable and can work optimally in a certained deadline. The first approachment of this research is a processor which has a priority arbiter/border of a task. The second approachment, is a numerator processor with variable precision (VP) computing. The third approachment is by functioning statistic control of the emergence task that will be observing with the help of coprocessor which is placed in the front section of bitspace architecture of the second approachment above. The last aprroachment is by adding certainty precision in form of arithmetic interval that is able to cut the data/task. The data/task-cut is in the form of upper and lower border from the bounds. These four approachments can be structured orthoganally or stand alone into a processor/several processors. Initial hyphothesis of these four approachments can produce a processor that can work optimally in time variable and in a fast, accurate, reliable and robust daedline in supporting real time data/task finishing.
KW - Coprocessor
KW - Interval arithmetic
KW - Time driven
KW - Variable precision computing
UR - http://www.scopus.com/inward/record.url?scp=84874570910&partnerID=8YFLogxK
U2 - 10.1109/CyberneticsCom.2012.6381632
DO - 10.1109/CyberneticsCom.2012.6381632
M3 - Conference contribution
AN - SCOPUS:84874570910
SN - 9781467308922
T3 - Proceeding - 2012 IEEE International Conference on Computational Intelligence and Cybernetics, CyberneticsCom 2012
SP - 129
EP - 132
BT - Proceeding - 2012 IEEE International Conference on Computational Intelligence and Cybernetics, CyberneticsCom 2012
Y2 - 12 July 2012 through 14 July 2012
ER -