Abstract Most Workload Control literature assumes that delivery performance is determined by tardiness related measures only. While this may be true for companies directly deliver to end-customers, make-to-stock or firms are part of supply chains, producing early often means large inventories in the finished goods warehouse penalties incurred downstream chain. Some earlier studies used a so-cal...

Healthcare systems are facing serious challenges in balancing their human resources to cope with volatile service demand, while at the same time providing necessary job satisfaction healthcare workers. In this paper, we propose a distributionally robust optimization formulation generate task assignment plan that promotes fairness allocation, attained by reducing difference total working among w...

We introduce a new performance metric, called Load Balancing Factor (LBF), to evaluate different tuning alternatives of workload migration within a distributed/parallel program. The metric is unique because it shows the performance implications of a specific tuning alternative rather than quantifying where time is spent in the program. Previously we developed a variation of the metric for coars...

We study an Airspace Resectorization Problem (ARP). A sectorization is a subdivision of an airspace into sectors, each managed by an airtraffic controller. A wellbalanced sectorization is a sectorization that distributes the workload evenly among the controllers. We discuss the problem of generating optimal sectorizations and describe GeoSect-Local, a tool that improves a given sectorization by...

We consider a challenging class of so-called RealTime Online Interactive Applications (ROIA); popular examples include multi-player online computer games, e-learning and training based on real-time simulations. ROIA combine high demands on scalability and real-time user interactivity with the problem of an efficient and economic utilization of resources with heterogeneous network capabilities. ...

This paper is a quantitative analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them route packets accurately with increased workload and some of them drastically cut down the workload. A...

This paper presents a sophisticated and efficient parallel scheme for the DIRECT global optimization algorithm of Jones et al. (1993). Although several sequential implementations for this algorithm have been successfully applied to large scale MDO problems, few parallel versions of the DIRECT algorithm have addressed well algorithm characteristics such as a single starting point, an unpredictab...

Commodity processors are comprised of several CPU cores and one integrated GPU. To fully exploit this type of architectures, one needs to automatically determine how to partition the workload between both devices. This is specially challenging for irregular workloads, where each iteration’s work is data dependent and shows control and memory divergence. In this paper, we present a novel adaptiv...

In numerical algorithms based on adaptive mesh re nement, the computational workload changes during the execution of the algorithms. In mapping such algorithms on to distributed memory architectures, dynamic load balancing is necessary to balance the workload among the processors in order to obtain high performance. In this paper, we propose a dynamic processor allocation algorithm for a mesh a...