2005년 대한 생화학·분자생물학회 하계학술대회를 다녀와서

We consider the problem of fair resource allocation in a system containing different resource types, where each user may have different demands for each resource. To address this problem, we propose Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types. We show that DRF, unlike other possible policies, satisfies several highly desirable properties. First, DRF incentivizes users to share resources, by ensuring that no user is better off if resources are equally partitioned among them. Second, DRF is strategy-proof, as a user cannot increase her allocation by lying about her requirements. Third, DRF is envy-free, as no user would want to trade her allocation with that of another user. Finally, DRF allocations are Pareto efficient, as it is not possible to improve the allocation of a user without decreasing the allocation of another user. We have implemented DRF in the Mesos cluster resource manager, and show that it leads to better throughput and fairness than the slot-based fair sharing schemes in current cluster schedulers.

https://static.usenix.org/event/nsdi11/tech/full_papers/Ghodsi.pdf

Dominant resource fairness: fair allocation of multiple resource types

Premises of creation of Internet portal designed to provide access to participants of educational and scientific process for the joint creation, consolidation, concentration and rapid spreading of educational and scientific information resources in its own depository are considered. CMS-based portal content management systems’ potentiality is investigated. Architecture for Internet portal of MES of Ukraine’s information resources is offered.

Створення порталу інформаційно-довідкових ресурсів міністерства освіти і науки україни

This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.

/pdf/a-survey-of-hard-real-time-scheduling-for-multiprocessor-313o35g6ho.pdf

A survey of hard real-time scheduling for multiprocessor systems

In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are known as “network flow models.” You will also see that if a network flow model has “integer-valued data,” the simplex method finds an optimal solution that is integer-valued.

Flows in Networks

This report provides an overview of the discussions, the program and the outcomes of the first Dagstuhl Seminar on Mixed Criticality on multicore/Manycore Platforms. The seminar brought together researchers working on challenges related to executing mixed criticality real-time applications on multicore and manycore architectures with the main purpose of promoting a closer interaction between the sub-communities involved in real-time scheduling, real-time operating systems / runtime environments, and timing analysis as well as interaction with specialists in hardware architectures.

https://drops.dagstuhl.de/opus/volltexte/2015/5270/pdf/dagrep_v005_i003_p084_s15121.pdf/

Mixed Criticality on Multicore/Manycore Platforms (Dagstuhl Seminar 15121)

Certain control computations may be modeled as periodic tasks with the correctness requirement that for each task, the fraction of jobs of the task that complete execution by their respective deadlines be no smaller than a specified value. This appears to be a correctness requirement that has not previously been studied in the real-time scheduling theory community; this paper formulates the problem and proposes some solution strategies.

https://dl.acm.org/doi/pdf/10.1145/3139258.3139272

A scheduling model inspired by control theory

A process and apparatus for making hollow carbon microspheres starting with hollow microballoons made of a material which can by heating be degraded to a carbon structure having a shape similar to that of the original microballoon. The disclosure teaches specific batch treating steps and apparatus for optimizing the rate of production of the microspheres, while at the same time minimizing degradation, rupture and cracking of the resulting carbon product.

Deadline-based scheduling of divisible real-time loads.

We consider the partitioned scheduling of sporadic, hard-real-time tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task's relative deadline is equal to its period). We relax the equality constraint on a task's deadline and consider task systems with constrained deadlines (i.e. relative deadlines are at most periods). In particular, we consider the first-fit decreasing partitioning algorithm. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is unlikely to be optimal. We quantitatively characterize the partitioning algorithm's worst-case performance in terms of resource augmentation.

Sanjoy Baruah

Papers

Mixed Criticality on Multicore/Manycore Platforms (Dagstuhl Seminar 15121)

A scheduling model inspired by control theory

Deadline-based scheduling of divisible real-time loads.

The partitioned, static-priority scheduling of sporadic real-time tasks with constrained deadlines on multiprocessor platforms

Limitations Concerning On-Line Scheduling Algorithms for Overloaded Real-Time Systems