Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogeneous systems, these two algorithms, called FCP and FLB, have shown to yield a performance equivalent to other much more costly algorithms such as MCP and ETF. In this paper we present modified versions of FCP and FLB tar...

Declustered data organizations have been proposed to achieve less-intrusive reconstruction of a failed disk’s contents. In previous work, Holland and Gibson identified six desirable properties for ideal layouts. Ideal layouts exist for a very limited family of configurations. The PRIME data layout deviates from the stated ideal only slightly and its run-time performance is very good for light w...

Programming by Demonstration (PbD) is an intuitive method to program a robot. The user, acting as a teacher or programmer, shows how a particular task can be performed. The demonstration is monitored using an interface device that allows the measurement and recording of both the applied commands as well as the data simultaneously perceived by robot's sensors. This paper considers the problems o...

One of the problems that sometimes occur in gas allocation optimization is instability phenomenon. This phenomenon reduces the oil production and damages downhole and surface facilities. Different works have studied the stability and suggested some solutions to override it, but most of them (such as making the well intelligent) are very expensive and thus they are not applicable to many cases. ...