Static scheduling of a program represented by a directed task graph on a multiprocessor system to minimize the program completion time is a well-known problem in parallel processing. Since finding an optimal schedule is an NP-complete problem in general, researchers have resorted to devising efficient heuristics. A plethora of heuristics have been proposed based on a wide spectrum of techniques, including branch-and-bound, integer-programming, searching, graph-theory, randomization, genetic algorithms, and evolutionary methods. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. Since these algorithms are based on diverse assumptions, they differ in their functionalities, and hence are difficult to describe in a unified context. We propose a taxonomy that classifies these algorithms into different categories. We consider 27 scheduling algorithms, with each algorithm explained through an easy-to-understand description followed by an illustrative example to demonstrate its operation. We also outline some of the novel and promising optimization approaches and current research trends in the area. Finally, we give an overview of the software tools that provide scheduling/mapping functionalities.

No abstract

No abstract

We develop a singular stochastic control model for pricing variable annuities with the guaranteed minimum withdrawal benefit. This benefit promises to return the entire initial investment, with withdrawals spread over the term of the contract, irrespective of the market performance of the underlying asset portfolio. A contractual withdrawal rate is set and no penalty is imposed when the policyholder chooses to withdraw at or below this rate. Subject to a penalty fee, the policyholder is allowed to withdraw at a rate higher than the contractual withdrawal rate or surrender the policy instantaneously. We explore the optimal withdrawal strategy adopted by the rational policyholder that maximizes the expected discounted value of the cash flows generated from holding this variable annuity policy. An efficient finite difference algorithm using the penalty approximation approach is proposed for solving the singular stochastic control model. Optimal withdrawal policies of the holders of the variable annuities with the guaranteed minimum withdrawal benefit are explored. We also construct discrete pricing formulation that models withdrawals on discrete dates. Our numerical tests show that the solution values from the discrete model converge to those of the continuous model.