In this paper, a List Simulated Anneal (LSA) algorithm is proposed for the DAG tasks scheduling on the Network-on-chip to simultaneously optimize makespan, load balance and average link load. A task list is first created for the DAG tasks, and the task-to-processor assignment is performed using Best Fit rule. Then the generated schedule is further optimized using LSA. In LSA, the task execution...

In this work we introduce a new algorithm for in-core parallel sorting integer keys which is based on the overpartitioning scheme introduced by Li and Sevcik [1]. The algorithm is devoted to clusters with processors running at different speeds i.e. correlated by a multiplicative constant factor. We compare experimentally this approach with another one related to the Parallel Sorting by Regular ...

The I/O subsystem is becoming a major bottleneck in an increasing number of computer systems. To provide improved I/O performance, as well as to accommodate growing storage requirements, disk subsystems are increasing in size. A major hurdle to obtaining the performance available from these large disk subsystems is load imbalance, or disk skew. Dynamic data placement, the conventional load bala...

Reducing cost of material handling has been a big challenge for companies. Flexible manufacturing system employed automated guided vehicles (AGV) to maintain efficiency and flexibility. This paper presents a new non-linear mathematical programming model to group n machines into N loops, to make an efficient configuration for AGV system in Tandem layout. The model minimizes bot...

The I/O subsystem is becoming a major bottleneck in an increasing number of computer systems. To provide improved I/O performance, as well as to accommodate growing storage requirements, disk subsystems are increasing in size. A major hurdle to obtaining the performance available from these large disk subsystems is load imbalance, or disk skew. Dynamic data placement, the conventional load bala...

We present two strategies to balance the load in a system with multiple virtual machines (VMs) through automated live migration. When the push strategy is used, overloaded hosts try to migrate workload to less loaded nodes. On the other hand, when the pull strategy is employed, the light-loaded hosts take the initiative to offload overloaded nodes. The performance of the proposed strategies was...

Traditional load balancing algorithms for data-intensive iterative routines can successfully load balance relatively small problems. We demonstrate that they may fail on highly heterogeneous HPC platforms. Traditional algorithms use models of processors’ performance which are too simplistic to reflect the many aspects of heterogeneity. This paper presents a new class of dynamic load balancing a...

The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a randomly structured overlay can not reflect the heterogeneity of a peer-to-peer system. In this paper, we propose a two-phase approach to exploit the heterogeneity in structured peer-to-peer systems. First, by exploiting...