Skip to main content

Scheduling in Compute Cloud with Multiple Data Banks Using Divisible Load Paradigm

You are here

he main challenge in a compute cloud system is to design a scheduling strategy for heterogeneous computing resources with shared data banks. Cloud user’s job arrives at the web role, which distributes the load to worker rules for concurrent processing. The worker role retrieves the respective data from the shared data banks. According to divisible load theory, the scheduling problem is formulated as relevant recursive equations and constraints that are derived from continuity of processing time due to retrieval from multiple data banks. The scheduling problem in compute cloud is formulated as a linear programming problem. Finally, we present a satellite image classification problem in compute cloud as an example to show the adequacy of the proposed solution.

Contact: 
S. Suresh

Field of Interest

“The field of interest shall be the organization, systems engineering, design, development, integration, and operation of complex systems for space, air, ocean, or ground environments. These systems include but are not limited to navigation, avionics, mobile electric power and electronics, radar, sonar, telemetry, military, law-enforcement, automatic test, simulators, and command and control."

Resources

Technology Navigator
Spectrum

Send Us A Message