On the complexity of implementation of recursion on factorial and Fibonacci algorithms using RISC-based MIPS64 instruction set architecture
College
College of Computer Studies
Department/Unit
Computer Technology
Document Type
Conference Proceeding
Source Title
IEEE Region 10 Annual International Conference, Proceedings/TENCON
Volume
2016-January
Publication Date
1-5-2016
Abstract
RISC-based MIPS64 Instruction Set Architecture (ISA) provides only a small and simplified set of instructions for program development. It is the task of the programmer to handle high-level constructs such as recursion. Recursion, on the other hand, involves other constructs such as subroutine, parameter passing and basic stack operations. This paper presents the intricacies on how recursion is implemented using RISC-based MIPS64 ISA. Factorial and Fibonacci algorithms are used as test cases in implementing recursion. Empirical results of time and space complexities of both algorithms are provided as well. © 2015 IEEE.
html
Digitial Object Identifier (DOI)
10.1109/TENCON.2015.7373115
Recommended Citation
Uy, R., & Marcos, N. (2016). On the complexity of implementation of recursion on factorial and Fibonacci algorithms using RISC-based MIPS64 instruction set architecture. IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2016-January https://doi.org/10.1109/TENCON.2015.7373115
Disciplines
Computer Sciences
Keywords
Recursion theory; MIPS (Computer architecture); Fibonacci numbers; Factor analysis
Upload File
wf_yes
