O uso de técnicas de cópia-zero e desvio do sistema operacional permitem a diminuição da latência de comunicação e o aumento da largura de banda. Menores latências e maiores larguras de banda contribuem para que o desempenho das aplicações paralelas seja mais alto, bem como torna-as mais escaláveis. Protocolos de comunicação que utilizam-se destas técnicas são conhecidos como protocolos de comunicação em nível de usuário. Baseado nas experiências de outros grupos de pesquisa na implementação de bibliotecas de comunicação e bibliotecas de programação paralelas sobre VIA e na experiência do GPPD na implementação da biblioteca DECK, este texto apresenta a implementação das primitivas DECK sobre o padrão VIA, o qual é classificado como sendo um protocolo de nível de usuário. O objetivo desta dissertação é implementar o DECK sobre VIA evitando qualquer cópia intermediária na comunicação de uma mensagem, atingindo assim cópia-zero. Dentre as bibliotecas de comunicação sobre VIA, DECK/VIA foi a única biblioteca que teve o compromisso ser totalmente livre de cópias intermediárias, embora houvesse que forçar um sincronismo na comunicação para manter este compromisso. Para a implementação do DECK/VIA, utilizou-se a implementação VI-GM de VIA para redes Myrinet. A biblioteca DECK/VIA demonstrou uma latência de 86.85 μs e uma largura de banda máxima de 205 Mbytes/s, 82% da banda nominal da rede Myrinet. Para validar a biblioteca foi executada a aplicação FT do pacote NPB. Apresenta-se comparações destes resultados frente aos resultados obtidos pela execução da mesma aplicação no DECK/GM, para redesMyrinet e DECK/TCP, para redes Ethernet. Constatou-se que mesmo com uma camada a mais de software e realizando todas as comunicações em três vias em virtude do handshake, DECK/VIA conseguiu valores de speedup bastante próximos de DECK/GM e de DECK/TCP para Gigabit Ethernet, superando os valores de DECK/TCP para Fast Ethernet. Conclui-se que o ideal na implementação de bibliotecas de programação paralela é encontrar uma solução balanceada entre a busca pelo desempenho e a manutenção da semântica original da biblioteca. O trabalho contribuiu com um survey de diversas soluções encontradas por outros grupos no desenvolvimento de bibliotecas de comunicação, que pode servir de guia para outros pesquisadores no desempenho da mesma tarefa. Também contribui com a introdução de um algoritmo para prevenção de deadlocks causados por comunicações síncronas. / Techniques like zero-copy and operating system bypass can decrease communication latency and increase bandwidth. Smaller latencies and greater bandwidths contribute for better performance in parallel applications and became them more scalables as well. Communication protocols using these techiniques are known as user-level communication protocols. Based on experiences from another research groups implementing communication libraries and parallel programming libraries over VIA and experience from GPPD implementing DECK, the text presents the implementation of DECK primitives over VIA standard, which is classified as an user-level protocol. The goal of this master’s thesis is implement DECK over VIA avoiding any intermediate copy between the data source and destination, reaching zero-copy. DECK/VIA is the unique library among all libriaries over VIA here studied totally free of intermediate copies, although a synchronous behavior was forced to keep this compromise. VI-GM, an implementation of VIA for Myrinet networks was used to implement DECK/VIA library. The implementation of DECK/VIA has shown a one-way latency of 86.85 μs and a maximum bandwidth of 205 Mbytes/s, 82% of nominal bandwidth of Myrinet network. To validate the library, the FT application from NPB was executed. Their results were compared with the results obtained with DECK/GM, for Myrinet networks and DECK/TCP, for Ethernet networks. Even with one additional software layer and doing all communication using a handshake, DECK/VIA reaches speedup values very closer of DECK/GMand DECK/TCP on Gigabit Ethernet and was better than DECK/TCP on Fast Ethernet. When implementing parallel programming libraries, we concluded the ideal solution is that meets the good balance between the quest for performance and the keeping of original library’s semantics. This work contibutes with a survey of communication libraries development, their problems and their solutions, which can guide others researchers performing the same task. Also it contributes with an algorithm to prevent deadlocks caused by synchonism.

O uso de técnicas de cópia-zero e desvio do sistema operacional permitem a diminuição da latência de comunicação e o aumento da largura de banda. Menores latências e maiores larguras de banda contribuem para que o desempenho das aplicações paralelas seja mais alto, bem como torna-as mais escaláveis. Protocolos de comunicação que utilizam-se destas técnicas são conhecidos como protocolos de comunicação em nível de usuário. Baseado nas experiências de outros grupos de pesquisa na implementação de bibliotecas de comunicação e bibliotecas de programação paralelas sobre VIA e na experiência do GPPD na implementação da biblioteca DECK, este texto apresenta a implementação das primitivas DECK sobre o padrão VIA, o qual é classificado como sendo um protocolo de nível de usuário. O objetivo desta dissertação é implementar o DECK sobre VIA evitando qualquer cópia intermediária na comunicação de uma mensagem, atingindo assim cópia-zero. Dentre as bibliotecas de comunicação sobre VIA, DECK/VIA foi a única biblioteca que teve o compromisso ser totalmente livre de cópias intermediárias, embora houvesse que forçar um sincronismo na comunicação para manter este compromisso. Para a implementação do DECK/VIA, utilizou-se a implementação VI-GM de VIA para redes Myrinet. A biblioteca DECK/VIA demonstrou uma latência de 86.85 μs e uma largura de banda máxima de 205 Mbytes/s, 82% da banda nominal da rede Myrinet. Para validar a biblioteca foi executada a aplicação FT do pacote NPB. Apresenta-se comparações destes resultados frente aos resultados obtidos pela execução da mesma aplicação no DECK/GM, para redesMyrinet e DECK/TCP, para redes Ethernet. Constatou-se que mesmo com uma camada a mais de software e realizando todas as comunicações em três vias em virtude do handshake, DECK/VIA conseguiu valores de speedup bastante próximos de DECK/GM e de DECK/TCP para Gigabit Ethernet, superando os valores de DECK/TCP para Fast Ethernet. Conclui-se que o ideal na implementação de bibliotecas de programação paralela é encontrar uma solução balanceada entre a busca pelo desempenho e a manutenção da semântica original da biblioteca. O trabalho contribuiu com um survey de diversas soluções encontradas por outros grupos no desenvolvimento de bibliotecas de comunicação, que pode servir de guia para outros pesquisadores no desempenho da mesma tarefa. Também contribui com a introdução de um algoritmo para prevenção de deadlocks causados por comunicações síncronas. / Techniques like zero-copy and operating system bypass can decrease communication latency and increase bandwidth. Smaller latencies and greater bandwidths contribute for better performance in parallel applications and became them more scalables as well. Communication protocols using these techiniques are known as user-level communication protocols. Based on experiences from another research groups implementing communication libraries and parallel programming libraries over VIA and experience from GPPD implementing DECK, the text presents the implementation of DECK primitives over VIA standard, which is classified as an user-level protocol. The goal of this master’s thesis is implement DECK over VIA avoiding any intermediate copy between the data source and destination, reaching zero-copy. DECK/VIA is the unique library among all libriaries over VIA here studied totally free of intermediate copies, although a synchronous behavior was forced to keep this compromise. VI-GM, an implementation of VIA for Myrinet networks was used to implement DECK/VIA library. The implementation of DECK/VIA has shown a one-way latency of 86.85 μs and a maximum bandwidth of 205 Mbytes/s, 82% of nominal bandwidth of Myrinet network. To validate the library, the FT application from NPB was executed. Their results were compared with the results obtained with DECK/GM, for Myrinet networks and DECK/TCP, for Ethernet networks. Even with one additional software layer and doing all communication using a handshake, DECK/VIA reaches speedup values very closer of DECK/GMand DECK/TCP on Gigabit Ethernet and was better than DECK/TCP on Fast Ethernet. When implementing parallel programming libraries, we concluded the ideal solution is that meets the good balance between the quest for performance and the keeping of original library’s semantics. This work contibutes with a survey of communication libraries development, their problems and their solutions, which can guide others researchers performing the same task. Also it contributes with an algorithm to prevent deadlocks caused by synchonism.

Orientadores: Carlos Alberto de Castro Junior, Alexandre de Assis Mota / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-11T20:26:47Z (GMT). No. of bitstreams: 1 AriaArias_David_M.pdf: 982619 bytes, checksum: 902edfe03a42ce4e64a22f698a4267cf (MD5) Previous issue date: 2008 / Resumo: O presente trabalho apresenta um modelo para o planejamento da operação de sistemas de potência visando maximizar a margem de estabilidade de tensão ao mesmo tempo em que minimizam-se os custos da produção da energia (despacho econômico). O objetivo é obter uma solução para o planejamento da operação da rede que leve em conta não só aspectos técnicos, mas também econômicos. Para que esse objetivo possa ser atingido, esse problema é formulado como um problema da programação bilevel (BLPP) ou em dois níveis. O modelo bilevel permite definir funções objetivo distintas para maximizar a margem da estabilidade de tensão e, ao mesmo tempo, conseguir um despacho econômico ótimo, permitindo a imposição de diferentes restrições para as variáveis internas e externas do problema. Uma vez que o BLPP apresenta-se como um problema matemático complexo, ele é reduzido a um problema de otimização de um só nível (single-level), substituindo-se o problema de otimização interno pelas condições de ótimalidade de Karush-Kuhn-Tucker (KKT). Foram realizados testes e simulações em diferentes sistemas elétricos, sendo que os resultados obtidos atestam a validade da metodologia proposta. Além disso, a formulação e o método de solução do BLPP apresentados neste trabalho são mais simples que outros encontrados na literatura, tornando essa metodologia bastante flexível para a utilização e investigação de outras funções objetivo, variáveis e parâmetros de controle. / Abstract: This work presents a model for power systems operation planning that aims to maximize the voltage stability margin and also the economic dispatch. The objective is to obtain a solution for the network operation planning that takes into account both technical and economical aspects. In order to reach this goal, this problem is formulated as a bilevel programming problem (BLPP). The bilevel model allows to define distinct objective functions for maximizing the voltage stability margin looking, simultaneously, for an optimum economic dispatch, and permitting the imposition of different constraints to the variables of the inner and outer problems. Since the BLPP is a complex mathematical problem, it is reduced to a single-level optimization problem by replacing the inner optimization problem by its Karush-Kuhn-Tucker optimality conditions. Simulations and tests were carried out for different electric networks, and the results show that the proposed methodology is valid. Moreover, the BLPP formulation and its solution method are simpler than other formulations found in the literature, making the methodology very flexible to accommodate other objective functions, variables and control parameters. / Mestrado / Energia Eletrica / Mestre em Engenharia Elétrica

Thesis deals with remote servers specifically those for the Minecraft. These servers are divided into groups. The work examines the possibility of remote access to these servers on network protocols level, which are described briefly, and also at the level of the game itself. Describes the game options that can be influenced via remote management. Then analyzes the applications that are intended for this remote access, and identifies problems associated with them. Based on the issues that implied from this analysis, application that solves these problems is designed. The first chapter contains a brief description of the network protocols that can be used to remotely manage servers for the Minecraft and identifies the most appropriate protocol. The next chapter describes the Minecraft, and specifically those of its regions which can be influenced via remote management. The next chapter analyzes the applications that can be used to remotely manage Minecraft servers and based on the problems that this analysis identifies, an application that solves these problems is designed. The designed application is then implemented. The last part contains user documentation of created application.

The idea of this diploma thesis is an origin application of optimization models to solve a wage funds allocation problem on various institutes of each faculty. This diploma thesis includes an outline of linear programming models, nonlinear programming models, multiply programming models and parametric programming models. Studied questions are debating in wider context of distributing financial resources from the Budget of the Czech republic, through Ministry of education, youth and sports, universities, faculties after as much as various institutes. The accent is given on question of definition assessment scales of achievement criteria with general-purpose kvantification.

This master's thesis deals with evolutionary algorithms and how them to use to design of combinational circuits. Genetic programming especially CGP is the most applicable to use for this type of task. Furthermore, it deals with computation on computer cluster and the use of evolutionary algorithms on them. For this computation is the most suited island models with CGP. Then a new way of recombination in CGP is designed to improve them. This design is implemented and tested on the computer cluster.

在統計學上我們經常會遭遇到如下的問題： minimze subject to 其中 和Ｃ都是已知。 上述非線性規劃（NONLINEAR PROGRAMING）問題的最佳解，是相當複雜的，以致於我 們無法用簡單的式子，將其解明確的表示出來。 RAO-GHANGURDE （１９７２）在“從有限母體抽樣的貝氏最佳解”這一篇文章中，對 這種非線性規劃問題，提出一個反覆演算的解法，來解決這類問題，由於，我們無法 看出其演算法的立論根據何在，收斂結果的精確性有多高，於是，本文在ｋ＝２及ｋ ＝３的情形下，由直覺的幾何觀點，提出了另一個求最佳解的方法，來驗證RAO-GHAN GURED 反覆演算法的類確性。 最後，本論文將上述非線性規劃問題的解法，應用到下面兩個例子上： （ａ）在 COCHRAN的“抽樣技巧”（ SAMPLING TECHNIQUES）這一本書裡，有關雙重 抽樣（DOUBLE SAMPLING ）的理論中，也遭遇到要解決這一類問題，但由他的公式， 所計算出來的解，並不一定會萬足所需要的限制條件。 （ｂ）在SMITH-SEDRASK （１９８２）的“推估魚群年齡成份的貝氏最佳解“和JINN -SMITH-SEDRASK（１９８７）的“推估魚群年齡成份的貝氏最佳雙重抽樣”這兩篇的 文章中，同樣的也遭遇到這一類的問題。

Cette thèse se place dans le contexte de l’hébergement de services informatiques virtualisés et apporte deux contributions. Elle propose premièrement un système d’aide à la gestion modulaire, déplaçant les machines virtuelles du centre pour le maintenir dans un état satisfaisant. Ce système permet en particulier d’intégrer la notion de consommation électrique des serveurs ainsi que des règles propres à cette consommation. Sa modularité permet de plus l’adaptation de ses composants à des problèmes de grande taille. Cette thèse propose de plus un outil pour comparer différents gestionnaires de centres virtualisés. Cet outil injecte un scénario de montée en charge reproductible dans une infrastructure virtualisée. L’injection d’un tel scénario permet d’évaluer les performances du système de gestion du centre grâce à des sondes spécifiques. Le langage utilisé pour cette injection est extensible et permet l’utilisation de scénarios paramétrés. / This thesis considers the virtualized IT services hosting and makes two contributions. It first proposes a modular system of management aids, to move the virtual machines of the center in order to keep it in a good condition. This system allows in particular to integrate the concept of server power consumption and rules specific to that concept. What’s more, its modularity allows to adjust its components to handle larger problems. This thesis proposes also a tool to compare different virtualized centers managers. This tool injects a reproductible load increase scenario in a virtualized infrastructure. The injection of such a scenario is used to evaluate the performance of the system center manager, using performances probes. The language used for this injection is extensible and allows the creation of parameterized scenarios. The contributions of this thesis were presented in two international conferences and a french conference.

Nous présentons les enjeux du management environnemental et soulignons l’importance d’une politique d’économie d’énergie pour les entreprises. Nous proposons un modèle pour déterminer le bilan énergétique de la fabrication en intégrant les différentes phases productives et non-productives. Nous définissons un double objectif pour la minimisation de la durée de production et de la consommation d’énergie. Nous appliquons ce modèle à l’ordonnancement d’ateliers job-shop flexibles. Pour déterminer la solution optimale nous utilisons deux classes de méthodes : - La première relève des algorithmes génétiques. Nous proposons différents types d’algorithmes pour résoudre ce problème multicritère. Nous proposons par exemple de faire évoluer deux populations pour minimiser respectivement l’énergie consommée et la durée de production et de les croiser pour atteindre l’objectif global. - La seconde relève de la programmation sous contrainte. Nous proposons de rechercher la solution optimale en développant une double arborescence pour évaluer l’énergie consommée et la durée de production. Nous construisons notre algorithme en partant des tâches à réaliser sur les machines ou en partant des machines qui réaliseront les tâches. Nous discutons de la construction du front de Pareto pour l’obtention de la meilleure solution.Nous terminons en comparant les différentes approches et en discutant leur pertinence pour traiter des problèmes de différentes tailles. Nous proposons également plusieurs améliorations et quelques pistes pour de futures recherches. / We present the challenges of environmental management and underline the importance of an energy saving policy for companies. We propose a model to determine the energy balance of manufacturing by integrating the different productive and non-productive phases. We define two purposes for minimizing production time and energy consumption. We apply this model to the scheduling of flexible job-shop workshops. To determine the optimal solution we use two types of methods: - The first is genetic algorithms. We propose different types of algorithms to solve this multi-criteria problem. For example, we propose to develop two populations to minimize the energy consumed and the production time, and to cross them to achieve the overall objective. - The second is constraint programming. We propose to find the optimal solution by developing a double tree to evaluate the energy consumed and the production time. We build our algorithm starting from the tasks to be performed on the machines or from the machines that will perform the tasks. We discuss the construction of the Pareto front to get the best solution.We finish by comparing the different approaches and discussing their relevance to deal with problems of different sizes. We also offer several improvements and some leads for future research.

近年線上教學平台有著很大的發展，不管是國內的均一教學平台，或國外知名的可汗教育平台，都提供各種學科便利學生自主學習。而在高中化學計算的領域中，這些平台上均提供各種教學課程。美中不足的是在線上的練習系統中，往往題目數量少、題目變化少、無詳細解題步驟，這樣將不足以透過題目衡量一個學生在各個主題的學習上有無明顯的進步。 本論文的目的是改善上述問題。我們設計並實做一系統，只要使用者輸入簡單需求，即可自動產生高中化學問題以及伴隨詳細解答，可方便出題者快速產生各式不同主題的高中化學應用題目。我們的系統提供一個Web前端供使用者輸入所需要生成的題目之資訊。系統由此收齊相關參數之後，接著即可依據參數產生符合題目限制條件的化學問題生成模型。此問題模型為一hypergraph，節點代表已知或未知相關化學量，超連結(hyperedge)則代表數個化學量間的相依關係。有了此一以ASP(Answer Set Programming)表達的問題模型之後，系統即可利用ASP求解器(Solver)進行單一或多個題目生成，後續工作則是驗證每一生成題目之可行性並產生解題步驟，最後經由Django整合呈現於Web上。 / In recent years there has been great progress in the development of online learning. Well-known platforms such as international Khan Academic or local Junyi Academy in Taiwan provide courses in various subjects allowing interested students to study in a very convenient and autonomous way. As expected, courses on common subjects such as high school chemistry are offered with rich content by these platforms. However, there are shortcomings in these courses about the problems they provide for the students to practice or test. In addition to rich content, an ideal course should provide abundant problems of all possible topics, with each given detailed solution, so that students can evaluate their achievement of study by practicing or testing themselves with these problems. Unfortunately, no courses on these platforms meet the above requirements. The purpose of this thesis is to improve the above shortcoming by providing a system which can generate automatically word problems on various topics of high school chemistry, together with detailed accompanied solutions. Our system is a web-based application implemented using Django. It provides a front-end enabling the users to enter related information for the word problems they want the system to generate. According to the parameters collected from the front-end, our system will generate a corresponding chemical problem model. The model is a hypergraph with nodes representing known or unknown chemical quantities related to the problem and hyperedges representing relations or dependencies among these quantities. After the model is generated as a logic program of ASP(Answer-set Programming), the system will use an ASP solver to generate one or more candidate problems. Subsequent works are then used to verify the feasibility of each problem and produce a solution for the feasible one. Finally the generated problems as well as solutions are wrapped in the server side and then sent to and presented friendly in the client's browser.