Concurrent scheduling: Efficient heuristics for online large-scale data transfers in distributed real-time environments

The static staging heuristics for staging data items related with real-time distributed applications stick to a method by which only one data item is transferred in a communication step to optimize a particular cost function and Extended Partial Path (EPP) algorithm is presented. The analytical results confirm that EPP performs equally or better than Partial Path Heuristic (PPH) and concurrent scheduling (CS) heuristic based on EPP is described which enables transfer of more than one data item in a organized manner simultaneously and results confirm the supremacy of CS over PPH.