No abstract

No abstract

Abstract-In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with ð k j Þ n spare nodes. Each set of j n regular nodes is connected to a spare node and the spare nodes are interconnected as either a ð k j Þ-ary n-cube if j 6 ¼ k 2 or a hypercube of dimension n if j ¼ k 2 . Our approach utilizes the capabilities of the wave-switching communication modules of the spare nodes to tolerate a large number of faulty nodes. Both theoretical and experimental results are examined. Compared with other proposed schemes, our approach can tolerate significantly more faulty nodes with a low overhead and no performance degradation.

Abstract-The trend towards ever more powerful and faster processors has led to an enormous increase in power consump tion. This paper focuses on scheduling tasks in a heterogeneous environment with DVS enabled processors to minimize both execution time and energy consumed. The proposed algorithm, called Energy-Dynamic Level Scheduling (EDLS), favors low energy consuming processors by introducing a cost factor that affects scheduling decisions. Our scheme allows for trade offs between energy consumption and the desired performance.Our simulation results exhibit significant power savings at a reasonable increase in overall execution time. Moreover, our results demonstrates a high degree of correlation between the energy saving and the increase in the heterogeneity of processors.

In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with k j n spare nodes; each set of j n regular nodes is connected to a spare node and the spare nodes are interconnected as a k j -ary n-cube.