The performance of the pipelining technique is highly dependent on the data dependency between instructions. In this paper, a pipeline scheduling algorithm, called hazards minimization with rotation scheduling (HAMMRS), is proposed to reduce pipeline hazards imposed by the data dependencies of the instructions in a loop. The HAMMRS algorithm is based on an architecture sensitive graph model, pi...

While research on the static scheduling of computational tasks for parallel systems has been ongoing for years, most work does not consider the communication costs nor does it consider the network congestion. A new static scheduling technique is presented which focuses on the communication overhead inherent in parallel processing systems. This paper builds a framework based on a newly developed...

While research on the static scheduling of computational tasks for parallel systems has been ongoing for years, most work does not consider the communication costs nor does it consider the network congestion. A new static scheduling technique is presented which focuses on the communication overhead inherent in parallel processing systems. This paper builds a framework based on a newly developed...

For a large multi-hop wireless network, nodes are preferable to make distributed and localized link-scheduling decisions with only interactions among a small number of neighbors. However, for a slowly decaying channel and densely populated interferers, a small size neighborhood often results in nontrivial link outages and is thus insufficient for making optimal scheduling decisions. A question ...

Creating quality construction schedules to mitigate delays often relies on experience. The lack of dissemination historic decision reasoning makes it harder. This study proposes a graph-based method find the time- and risk-efficient patterns from projects help schedulers improve productivity accuracy. leverages schedule data obtained Tier-1 contractor validates for excavation activities. result...

This paper presents a swarm intelligence based approach for optimal scheduling in sensor networks. Sensors are characterized by their transaction times and interdependencies. In the presence of interdependencies the problem of optimal scheduling to minimize the overall transaction/response time is modeled as a graph partitioning problem. Graph partitioning problem is a well known NPcomplete pro...

This paper presents a graph-theoretic technique for scheduling of multipurpose batch processes with the objective of maximizing throughput over a fixed time horizon. The presented technique is based on the S-graph framework which embeds the necessary scheduling information pertaining to recipes of different batches and possible resource allocation. The distinct feature of this contribution is t...