Sharif Digital Repository

The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this Inherent regularity. This paper introduces some novel algorithms for deriving resource placement schemes in product networks based on the assumed perfect resource placement in their underling basic graphs. © 2007 IEEE  

The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource... 

In this study, the steady-state operation of the brushless doubly-fed machine (BDFM) in various modes is physically elaborated and the active power flow and torque analysis are presented for each operating mode alongside confirmatory experimental results on a 4/8 pole D160 size machine. The machine behaviour in asynchronous operating modes is described similar to the conventional induction machines with corresponding pole numbers. Moreover, its performance in synchronous mode is shown to be similar to synchronous machines. On the basis of the above, the BDFM performance is further analysed under two possible fault conditions: first, a controller or converter fault leading to loss of... 

The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource...