Notice Board :

Call for Paper
Vol. 7 Issue 9

Submission Start Date:
Sep 01, 2020

Acceptence Notification Start:
Sep 10, 2020

Submission End:
Sep 25, 2020

Final MenuScript Due:
Sep 30, 2020

Publication Date:
Sep 30, 2020
                         Notice Board: Call for PaperVol. 7 Issue 9      Submission Start Date: Sep 01, 2020      Acceptence Notification Start: Sep 10, 2020      Submission End: Sep 25, 2020      Final MenuScript Due: Sep 30, 2020      Publication Date: Sep 30, 2020




Volume VII Issue IV

Author Name
Anju Dave, Dr. Deepika Pathak
Year Of Publication
2020
Volume and Issue
Volume 7 Issue 4
Abstract
Code generation is an important part of compiler design. This phase takes optimized Intermediate Representations (IR) code from IR optimizer. The main goal of this phase is to select appropriate machine instruction from all IR instructions and allocate the finite machine resources like register allocation, cache memory etc. In this paper a tree based register allocation technique is proposed. This proposed algorithm is inspired by graph coloring algorithm. Proposed algorithm gives good performance in high amount variables program.
PaperID
2020/IJTRM/4/2020/35438

Author Name
Neelema Rai, Dr. Deepika Pathak
Year Of Publication
2020
Volume and Issue
Volume 7 Issue 4
Abstract
In presents scenario cloud computing is most suitable and used IT service solution. Cloud service model provide various services on the basis of pay per use, which is a cost effective and easily available solution for different IT resource requirement like data storage, computing power, network services, working platforms and software. From the cloud management point of view, it is required to provide maximum services with minimum resources. To achieve this objective cloud should have a powerfully cloud resource allocation strategy. This paper presented a cloud resource allocation algorithm based on graph coloring algorithm. This paper also suggested an edge cover based graph coloring algorithm for cloud resource allocation. Implementation prospective and experimental result with analysis is also discussed in this paper.
PaperID
2020/IJTRM/4/2020/35452

Author Name
Ankita Thakur, Prof. Amit Sariya
Year Of Publication
2020
Volume and Issue
Volume 7 Issue 4
Abstract
The myriad of potential applications supported by wireless sensor networks (WSNs) has generated much interest from the research community. Various applications range from small size low industrial monitoring to large scale energy con-strained environmental monitoring. In all cases, an operational network is required to fulfill the application missions. In addition, energy consumption of nodes is a great challenge in order to maximize network lifetime. Unlike other networks, it can be hazardous, very expensive or even impossible to charge or replace exhausted batteries due to the hostile nature of environment. Researchers are invited to design energy efficient protocols while achieving the desired network operations. This paper focuses on different techniques to reduce the consumption of the limited energy budget of sensor nodes. After having identified the reasons of energy waste in WSNs, we classify energy efficient techniques into five classes, namely data reduction, control reductio
PaperID
2020/IJTRM/4/2020/35484