Issue No. 12 - December (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.89
R. A. Beyah , Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
W. H. Robinson , Dept. of Electr. Eng. & Comput. Sci., Vanderbilt Univ., Nashville, TN, USA
L. Watkins , Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA
We present the details of a novel method for passive resource discovery in cluster grid environments, where resources constantly utilize internode communication. Our method offers the ability to nonintrusively identify resources that have available CPU cycles; this is critical for lowering queue wait times in large cluster grid networks. The benefits include: 1) low message complexity, which facilitates low latency in distributed networks, 2) scalability, which provides support for very large networks, and 3) low maintainability, since no additional software is needed on compute resources. Using a 50-node (multicore) test bed (DETERlab), we demonstrate the feasibility of our method with experiments utilizing TCP, UDP, and ICMP network traffic. We use a simple but powerful technique that monitors the frequency of network packets emitted from the Network Interface Card (NIC) of local resources. We observed the correlation between CPU load and the timely response of network traffic. A highly utilized CPU will have numerous, active processes which require context switching. The latency associated with numerous context switches manifests as a delay signature within the packet transmission process. Our method detects that delay signature to determine the utilization of network resources. Results show that our method can consistently and accurately identify nodes with available CPU cycles (<;70 percent CPU utilization) through analysis of existing network traffic, including network traffic that has passed through a switch (noncongested). Also, in situations where there is no existing network traffic for nodes, ICMP ping replies can be used to ascertain this resource information.
telecommunication traffic, communication complexity, grid computing, network interfaces, packet switching, queueing theory, resource information, passive solution, CPU resource discovery problem, cluster grid networks, cluster grid environments, internode communication, nonintrusively identify resources, CPU cycles, queue wait times, message complexity, distributed networks, scalability, very large networks, compute resources, multicore test bed, DETERlab, TCP network traffic, UDP network traffic, ICMP network traffic, network packets, network interface card, NIC, CPU load, context switching, delay signature, packet transmission process, network resources, network traffic analysis, ICMP ping reply, Decision support systems, Complexity theory, Clustering methods, Grid computing, Network interfaces, clustering algorithm., Cluster grid computing, passive resource discovery
R. A. Beyah, W. H. Robinson, L. Watkins, "A Passive Solution to the CPU Resource Discovery Problem in Cluster Grid Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 2000-2007, December 2011, doi:10.1109/TPDS.2011.89