A Research of Resource Scheduling Algorithm Based on Hadoop

With the development of electronic devices, more and more mobile clients are connected to the Internet and they generate massive data every day. We live in an age of “Big Data”, and every day we generate hundreds of million magnitude data. By analyzing the data and making prediction, we can carry out better development plan. Unfortunately, traditional computation framework cannot meet the demand, so the Hadoop would be put forward. First the paper introduces the background and development status of Hadoop, compares the MapReduce in Hadoop 1.0 and YARN in Hadoop 2.0, and analyzes the advantages and disadvantages of them. Because the resource management module is the core role of YARN, so next the paper would research about the resource allocation module including the resource management, resource allocation algorithm, resource preemption model and the whole resource scheduling process from applying resource to finishing allocation. Also it would introduce the FIFO Scheduler, Capacity Scheduler, and Fair Scheduler and compare them. The main work has been done in this paper is researching and analyzing the Dominant Resource Fair algorithm of YARN, putting forward a maximum resource utilization algorithm based on Dominant Resource Fair algorithm. The paper also provides a suggestion to improve the unreasonable facts in resource preemption model. Emphasizing “fairness” during resource allocation is the core concept of Dominant Resource Fair algorithm of YARM. Because the cluster is multiple users and multiple resources, so the user’s resource request is multiple too. The DRF algorithm would divide the user’s resources into dominant resource and normal resource. For a user, the dominant resource is the one whose share is highest among all the request resources, others are normal resource. The DRF algorithm requires the dominant resource share of each user being equal. But for these cases where different users’ dominant resource amount differs greatly, emphasizing “fairness” is not suitable and can’t promote the resource utilization of the cluster. By analyzing these cases, this thesis puts forward a new allocation algorithm based on DRF. The new algorithm takes the “fairness” into consideration but not the main principle. Maximizing the resource utilization is the main principle and goal of the new algorithm. According to comparing the result of the DRF and new algorithm based on DRF, we found that the new algorithm has more high resource utilization than DRF. The last part of the thesis is to install the environment of YARN and use the Scheduler Load Simulator (SLS) to simulate the cluster environment.

Delivery of European Cross-Border Health Care and the Relevance and Effects of EU Regulations and Judicial Processes with Reference to Delivery of Drugs and Blood Donor Information Material.

Valtion rajat ylittävät terveyspalvelut Euroopan unionissa sekä Euroopan unionin säädösten merkitys ja vaikutus erityisesti lääkejakeluun ja verenluovuttajille jaettavaan tiedotusaineistoon Valtion rajat ylittävä terveydenhuolto on suuren kiinnostuksen kohteena Euroopan unionissa. Resurssien hyödyntäminen parhaalla mahdollisella tavalla ja tiedon keskittäminen ovat tarpeen terveydenhuollon kustannusten alati noustessa. Terveydenhuoltopalvelut kuuluvat Euroopan sisämarkkinoiden vapaan liikkuvuuden piiriin. Euroopan unionilla ei ole kuitenkaan toimivaltaa säädellä terveydenhuoltojärjestelmiä, vaan sen mahdollisuudet ovat enimmäkseen kansanterveyden edistämisessä ja suojelussa, myös muilla toimialueilla kuin terveydenhuollossa. Tutkimuksen tavoitteena oli tutkia Euroopan unionin säädösten vaikutusta terveydenhuoltosektoriin, erityisesti valtion rajat ylittäviin terveydenhuoltopalveluihin. Erityiskohteena olivat lääkemääräyksen toimittaminen toisen Euroopan unionin jäsenmaan apteekista, resepti-lääkkeiden maahantuonti omaan henkilökohtaiseen käyttöön, sähköisen lääkemääräyksen käyttö kansallisesti ja mahdollisuudet sen käyttöön eri jäsenmaiden välillä, online-apteekkien soveltuvuus Euroopan unionin sisämarkkinoille sekä verenluovuttajille jaettavan tiedotusaineiston yhtenäistämistarve Euroopan unionin alueella. Tutkimuksen osa-alueiden aineisto koottiin vuosina 1999–2003, jolloin Euroopan unioniin kuului 15 jäsenmaata. Apteekit toimittivat useimmiten myös ei-kansalliset, toisessa Euroopan unionin jäsenmaassa annetut lääkemääräykset. Kaikki jäsenmaat rajoittivat lääkemääräyksen vaativien lääkkeiden maahantuontia. Rajoituksia oli maahantuontimäärissä ja -tavoissa. Lisäksi sairasvakuutuskorvausten saaminen ulkomailla lunastetuista reseptilääkkeistä oli hankalaa. Sähköiset lääkemääräykset olivat käytössä vain kahdessa maassa, mutta useissa maissa suunniteltiin niiden kokeilua. Standardit ja käyttöjärjestelmät olivat erilaisia eri maissa. Euroopan unionin alueelle on perustettu online-apteekkeja, joiden toiminta on kuitenkin vaatimatonta. Verenluovuttajille annettava tiedotusaineisto ei missään maassa täyttänyt veridirektiivin vaatimuksia. Tutkimuksen tulokset osoittivat kansallisten käytäntöjen eroavaisuuksien rajoittavan valtion rajat ylittäviä terveydenhuoltopalveluita. Vaikka Euroopan unionin tavoitteena ei ole yhtenäistää terveydenhuoltojärjestelmiä, on tarpeen arvioida uudelleen unionin ja jäsenmaiden välistä työnjakoa. Kansalliset terveydenhuoltojärjestelmät eivät ole erillään Euroopan sisämarkkinoista, jotka merkittävästi vaikuttavat terveydenhuoltoon.

En vårdvetenskaplig syntes mellan vårdandets ethos och vårdintensitet

This is a study in the field of caring science. The kinds of knowledge expansion and theoretical formation outlined in this thesis have a hypothetic-deductive design. The synthesizer of caring science between caring ethos and nursing intensity evolves through a hermeneutic movement between understanding and interpretation, in the dialectic tension between thesis and antithesis. The study had three main aims with corresponding research questions. The first aim was to deepen the understanding of caring ethos within the care of older people from the perspective of caring science. The second aim was to deepen the understanding of nursing intensity within the care of older people, again from the perspective of caring science. The third aim of the study was to create a theoretical model describing the synthesizer between the caring ethos and nursing intensity. The synthesizer of caring science between caring ethos and nursing intensity took place in a process of creativity, which resulted in six new patterns of interpretation. Good care is in constant movement and tension between the ethical and the unethical. In order to guarantee the older person of the future dignity, a caring community, and integrity in care, there is a need for an awareness of and responsibility for those entities than can become ethical problems and dilemmas. The model that describes the synthesizer between caring ethos and nursing intensity, consist of four cornerstones such as caring ethics, wishes and anticipations, an ethical manner in words and action, and ethical leadership. Good care based on the values dignity, a caring community, safety, and integrity, receive their legitimacy through ethical awareness, and consent among caregivers. Ethical awareness deepens the understanding of wishes and expectations that may arise as special needs. Care thus requires an awareness of the balance between the patient’s care need and optimal level of nursing intensity. An ethical leadership considers the needs of the patient and accepts nothing but a work situation where optimal nursing intensity and optimal resource allocation makes good care possible.

Algorithmic Solutions for Combinatorial Problems in Resource Management of Manufacturing Environments

This thesis studies the use of heuristic algorithms in a number of combinatorial problems that occur in various resource constrained environments. Such problems occur, for example, in manufacturing, where a restricted number of resources (tools, machines, feeder slots) are needed to perform some operations. Many of these problems turn out to be computationally intractable, and heuristic algorithms are used to provide efficient, yet sub-optimal solutions. The main goal of the present study is to build upon existing methods to create new heuristics that provide improved solutions for some of these problems. All of these problems occur in practice, and one of the motivations of our study was the request for improvements from industrial sources. We approach three different resource constrained problems. The first is the tool switching and loading problem, and occurs especially in the assembly of printed circuit boards. This problem has to be solved when an efficient, yet small primary storage is used to access resources (tools) from a less efficient (but unlimited) secondary storage area. We study various forms of the problem and provide improved heuristics for its solution. Second, the nozzle assignment problem is concerned with selecting a suitable set of vacuum nozzles for the arms of a robotic assembly machine. It turns out that this is a specialized formulation of the MINMAX resource allocation formulation of the apportionment problem and it can be solved efficiently and optimally. We construct an exact algorithm specialized for the nozzle selection and provide a proof of its optimality. Third, the problem of feeder assignment and component tape construction occurs when electronic components are inserted and certain component types cause tape movement delays that can significantly impact the efficiency of printed circuit board assembly. Here, careful selection of component slots in the feeder improves the tape movement speed. We provide a formal proof that this problem is of the same complexity as the turnpike problem (a well studied geometric optimization problem), and provide a heuristic algorithm for this problem.

Aging based maintenance and reinvestment scheduling of electric distribution

The maintenance of electric distribution network is a topical question for distribution system operators because of increasing significance of failure costs. In this dissertation the maintenance practices of the distribution system operators are analyzed and a theory for scheduling maintenance activities and reinvestment of distribution components is created. The scheduling is based on the deterioration of components and the increasing failure rates due to aging. The dynamic programming algorithm is used as a solving method to maintenance problem which is caused by the increasing failure rates of the network. The other impacts of network maintenance like environmental and regulation reasons are not included to the scope of this thesis. Further the tree trimming of the corridors and the major disturbance of the network are not included to the problem optimized in this thesis. For optimizing, four dynamic programming models are presented and the models are tested. Programming is made in VBA-language to the computer. For testing two different kinds of test networks are used. Because electric distribution system operators want to operate with bigger component groups, optimal timing for component groups is also analyzed. A maintenance software package is created to apply the presented theories in practice. An overview of the program is presented.