Maximizing contention-free executions in multiprocessor scheduling

It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots at which the number of competing tasks is smaller than or equal to the number of available processors. This paper presents a policy (called CF policy) that utilizes such contention-free slots effectively. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from tasks is reduced when their executions are postponed to contention-free slots. Finally, using the properties of the CF policy, we derive a counter-intuitive claim that shortening of task deadlines can help improve schedulability of task systems. We present heuristics that effectively reduce task deadlines for better scheduability without performing any exhaustive search.

Maximizing the Social Welfare of Virtual Power Players Operation in Case of Excessive Wind Power

The integration of growing amounts of distributed generation in power systems, namely at distribution networks level, has been fostered by energy policies in several countries around the world, including in Europe. This intensive integration of distributed, non-dispatchable, and natural sources based generation (including wind power) has caused several changes in the operation and planning of power systems and of electricity markets. Sometimes the available non-dispatchable generation is higher than the demand. This generation must be used; otherwise it is wasted if not stored or used to supply additional demand. New policies and market rules, as well as new players, are needed in order to competitively integrate all the resources. The methodology proposed in this paper aims at the maximization of the social welfare in a distribution network operated by a virtual power player that aggregates and manages the available energy resources. When facing a situation of excessive non-dispatchable generation, including wind power, real time pricing is applied in order to induce the increase of consumption so that wind curtailment is minimized. This method is especially useful when actual and day-ahead resources forecast differ significantly. The distribution network characteristics and concerns are addressed by including the network constraints in the optimization model. The proposed methodology has been implemented in GAMS optimization tool and its application is illustrated in this paper using a real 937-bus distribution network with 20.310 consumers and 548 distributed generators, some of them non-dispatchable and with must take contracts. The implemented scenario corresponds to a real day in Portuguese power system.

An heuristic approach for optimal location of gas supply units in transportation system

The best places to locate the Gas Supply Units (GSUs) on a natural gas systems and their optimal allocation to loads are the key factors to organize an efficient upstream gas infrastructure. The number of GSUs and their optimal location in a gas network is a decision problem that can be formulated as a linear programming problem. Our emphasis is on the formulation and use of a suitable location model, reflecting real-world operations and constraints of a natural gas system. This paper presents a heuristic model, based on lagrangean approach, developed for finding the optimal GSUs location on a natural gas network, minimizing expenses and maximizing throughput and security of supply.The location model is applied to the Iberian high pressure natural gas network, a system modelised with 65 demand nodes. These nodes are linked by physical and virtual pipelines – road trucks with gas in liquefied form. The location model result shows the best places to locate, with the optimal demand allocation and the most economical gas transport mode: by pipeline or by road truck.

Stochastic short-term maintenance scheduling of GENCOs in an oligopolistic electricity market

In the proposed model, the independent system operator (ISO) provides the opportunity for maintenance outage rescheduling of generating units before each short-term (ST) time interval. Long-term (LT) scheduling for 1 or 2 years in advance is essential for the ISO and the generation companies (GENCOs) to decide their LT strategies; however, it is not possible to be exactly followed and requires slight adjustments. The Cournot-Nash equilibrium is used to characterize the decision-making procedure of an individual GENCO for ST intervals considering the effective coordination with LT plans. Random inputs, such as parameters of the demand function of loads, hourly demand during the following ST time interval and the expected generation pattern of the rivals, are included as scenarios in the stochastic mixed integer program defined to model the payoff-maximizing objective of a GENCO. Scenario reduction algorithms are used to deal with the computational burden. Two reliability test systems were chosen to illustrate the effectiveness of the proposed model for the ST decision-making process for future planned outages from the point of view of a GENCO.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

Social welfare with a foreign competitor

In this paper, we consider a mixed market in which a state-owned welfare-maximizing public (domestic) firm competes against a profit-maximizing private (foreign) firm. We suppose that the domestic firm is less eflScient than the foreign firm. However, the domestic firm can lower its marginal costs by conducting cost-reducing R&D investment. We examine the impacts of entry of a foreign firm on decisions upon cost-reducing R&D investment by the domestic firm and how these affect the domestic welfare.

Environmental policies in an international mixed duopoly

The purpose of this paper is to study the effects of environmental and trade policies in an international mixed duopoly serving two markets. We suppose that the firm in the home country is a welfare-maximizing public firm, while the firm in the foreign country is its own profit-maximizing private firm. We find that the environmental tax can be a strategic instrument for the home government to distribute production from the foreign private firm to the home public firm. An additional effect of the home environmental tax is the reduction of the foreign private firm's output for local consumption, thereby expanding the foreign market for the home public firm.

Scalable and Efficient Configuration of TimeDivision Multiplexed Resources

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average performance. For cost-efficient design, contemporary platforms feature an increasing number of cores that share resources, such as memories and interconnects. However, resource sharing causes contention that must be resolved by a resource arbiter, such as Time-Division Multiplexing. A key challenge is to configure this arbiter to satisfy the bandwidth and latency requirements of the real-time applications, while maximizing the slack capacity to improve performance of their non-real-time counterparts. As this configuration problem is NP-hard, a sophisticated automated configuration method is required to avoid negatively impacting design time. The main contributions of this article are: 1) An optimal approach that takes an existing integer linear programming (ILP) model addressing the problem and wraps it in a branch-and-price framework to improve scalability. 2) A faster heuristic algorithm that typically provides near-optimal solutions. 3) An experimental evaluation that quantitatively compares the branch-and-price approach to the previously formulated ILP model and the proposed heuristic. 4) A case study of an HD video and graphics processing system that demonstrates the practical applicability of the approach.