Modifying the logic gate symbols to enrich the designing of the computer systems by 3-D bit-matrices
Date
2018-12
Authors
Journal Title
Journal ISSN
Volume Title
Type
Article
Publisher
ELSEVIER SCIENCE BV
Series Info
AIN SHAMS ENGINEERING JOURNAL;Volume: 9 Issue: 4 Pages: 3207-3216
Scientific Journal Rankings
Abstract
Recently, the most computer and digital systems are built based on the parallelism to increase their speed of processing.
The complications of these systems are increasing proportionally with the complexity of the used parallelism methodologies. According to the growing of this complexity, this research proposes a modification to enhance designing tasks by the concept of the 3-dimensions easily.
This research introduces a novel terminology called "Bit-Vector-Matrix". Moreover, this research modifies the standard logic symbols beside reformulates their conventional Boolean algebraic expressions to become more convenient and compatible with the "Bit-Vector-Matrix".
We proposed novel logic gate symbols called "Peer-logic-gates". They are useful for representing the intensive concurrent logical operations through intensive parallel digital buses in computer systems. In addition, they will be a promising teaching tool to instruct many computer courses.
This paper constructed based on the deterministic algorithm, realized using VHDL codes and evaluated by the reliable simulator "Modelsim". (C) 2018 Ain Shams University.
Description
Accession Number: WOS:000454548400252
Keywords
University for October University for Matrices, Boolean algebra, Microprocessors, VHDL module, Deterministic algorithm, Models
Citation
Website https://software.intel.com/en-us/blogs/2013/avx-512-instructions By James R. (Intel), published on July 23, 2013, updated June 20, 2017, March 9, 2018. Google Scholar [2] Oliveira Gustavo Prado, de Assumpção Drummond Lucia M, Boaventura Ricardo Soares, Yamanaka Keiji. Evaluating performance of deterministic algorithms on a multicore processor of a public cloud. In: IEEE international symposium on computer architecture and high performance computing workshop, 2014. Google Scholar [3] Ayaz ul Hassan, Mayez Al- Mouhamed, Allam Fatayer, N. Mohammad Optimizing the matrix multiplication using strassen and winograd algorithms with limited recursions on many-core Int J Parallel Prog (2016) August Google Scholar [4] Randal E. Bryant Graph-based algorithms for Boolean function manipulation Trans Comput, C-35-8 (1986), pp. 677-691 IEEE CrossRefView Record in ScopusGoogle Scholar [5] Chattopadhyay A, Amar L, Soeken M, Gaillardon P, De Micheli G. Notes on Majority Boolean algebra, IEEE; 2016. Google Scholar [6] Haitao Zhang, Guoqiang Li, Daniel Sun, Lu Yonggang, Ching-Hsien Hsu Verifying cooperative software, a SMT-based bounded model checking approach for deterministic scheduler J Syst Archit (2017)