##plugins.themes.academic_pro.article.main##

Abstract

It is generally difficult for a system to ensure load symmetry and resource constraints at a time. When we deal with the resources such as CPU and memory in the task related with real time it is very complicated process of manipulation of resources in multiple processor systems. In simple word resource scheduling and manipulation is a key problem in multiprocessor system. To solve this problem a phenomenon of load symmetry and divination is discussed to integrate and manage resources in multiprocessor system in this paper. This phenomenon significantly predicts the wait time before a packet to be processed based on the load of the processor and the timestamp of the packet. We use simulation experiment to present that the phenomenon can decrease the possibility of packets delay and increase the concurrency of flows that the system can serve easily. It also deduces about migration of packet between processors to guarantee that the packets can be processed before time. This phenomenon increases utilization of multiple processors and also build up the capacity of system to face difficulties occurred in packet migration between processors.

Keywords: JAVA, Swing(JFC), Eclipse 3.3

##plugins.themes.academic_pro.article.details##

Author Biographies

Imran Mulla, MLR Institute of Technology, Dundigal, Hyderabad, Telangana, India

CSE Department,

Karunakar Kothapelli, MLR Institute of Technology, Dundigal, Hyderabad, Telangana, India

Assistant Professor, CSE Department
How to Cite
Mulla, I., & Kothapelli, K. (2014). Significantly Load Divination and Multiple Processor Support for Manipulation of Resources. International Journal of Emerging Trends in Science and Technology, 1(07). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/318

References

1. F. Douglis and J. Ousterhout, “Transparent process migration: design alternatives and the sprite implementation, Software Practice & Experience”, vol.21 no.8, pp.757-785, Aug. 1991.
2. Harchol-Baker and A. Downey, “Exploiting process lifetime distributions for dynamic load balancing”, ACM Transactions on Computer Systems (TOCS), vol.15 no.3, Aug. 1997
3. C.-C. Hui and S.T. Chanson, “Improved strategies for dynamic load balancing”, IEEE Concurrency, vol.7, no.3, pp.58-67, Jul-Sep 1999.
4. Acharya and S. Setia, “Availability and Utility of Idle Memory in Workstation Clusters”, Proc. ACM SIGMETRICS Conf. Measuring and Modeling of Computer Systems, pp. 35-46, May 1999.
5. X. Zhang, Y. Qu and L. Xiao, “Improving Distributed Workload Performance by Sharing Both CPU and Memory Resources,” Proc. 20th Int"l Conf. Distributed Computing Systems, (ICDCS "2000), pp. 233-241, Apr. 2000.
6. L. Xiao, X. Zhang and Y. Qu, “Effective Load Sharing on Heterogeneous Networks of Workstations”, Proc. 2000 Int"l Parallel and Distributed Processing Symp., (IPDPS"2000), pp. 431-438, May 2000