Article
Online Scheduling FIFO Policies with Admission and Push-Out
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when a policy is permitted to drop already admitted packets) and non-push-out cases. We provide worst-case guarantees for the throughput performance of our algorithms, proving both lower and upper bounds on their competitive ratio against the optimal algorithm, and conduct a comprehensive simulation study that experimentally validates predicted theoretical behavior.
In this paper presented slot selection algorithms in economic model for independent job batch scheduling in a distributed computing with non-dedicated resources. Exiting approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. This paper discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are compared. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole bath of jobs and to increase overall efficiency of scheduling.
This is the first book on the U.S. presidential election system to analyze the basic principles underlying the design of the existing system and those at the heart of competing proposals for improving the system. The book discusses how the use of some election rules embedded in the U.S. Constitution and in the Presidential Succession Act may cause skewed or weird election outcomes and election stalemates. The book argues that the act may not cover some rare though possible situations which the Twentieth Amendment authorizes Congress to address. Also, the book questions the constitutionality of the National Popular Vote Plan to introduce a direct popular presidential election de facto, without amending the Constitution, and addresses the plan’s “Achilles’ Heel.” In particular, the book shows that the plan may violate the Equal Protection Clause from the Fourteenth Amendment of the Constitution. Numerical examples are provided to show that the counterintuitive claims of the NPV originators and proponents that the plan will encourage presidential candidates to “chase” every vote in every state do not have any grounds. Finally, the book proposes a plan for improving the election system by combining at the national level the “one state, one vote” principle – embedded in the Constitution – and the “one person, one vote” principle. Under this plan no state loses its current Electoral College benefits while all the states gain more attention of presidential candidates.
This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated schedules on local processor nodes. Schedule optimization is performed using dynamic programming methods using the set of criteria in accordance with the economic policy of the virtual organization.
This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated schedules on local processor nodes. Schedule optimization is performed using dynamic programming methods using the set of criteria in accordance with the economic policy of the virtual organization.
This work presents slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed and compared. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.
In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.
In this article some questions of technical systems scheduling and maintenance are considered on example vehicles. From one side, the scheduling has to satisfy the requirements of safety and be the effective for equability criterion, from another side. The mathematical apparatus, used in the article, bases on the combinatory and graph theory.
The problem of management of the nonlinear object which is exposed to impact of uncontrollable indignations, is considered in a key of differential game. Synthesis of optimum managements is made with application of transformation of the nonlinear equation of initial object in the differential equation with the parameters depending on a condition. The square-law functional of quality allows to formulate synthesis conditions in the form of need of search of solutions of the equation of Rikkati. The solution of the equation of Rikkati with the parameters depending on a condition, is in a symbolical view with application of algebraic methods that allows to generalize a number of earlier published theoretical results, to receive rather constructive decisions in a number of statements of problems of management.
The article is based upon the fact that the growing demand for master data management systems has not yet produced a commonly accepted metodology for their design and development/ The article offers two mathematical models? that allow a master data management systems designer a way to formally describe their system before development and verify the system quality by measurements? unique to master data management systems.