Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

Ultra deep blue: the ultimate chess player

Projecte d'adaptació del programa GNU Chess al sistema de grid computing 'Condor'. I amb això, es planteja un estudi sobre els algorismes de cerca i la seva aplicació en entorns distribuïts. Una sèrie de proves sobre unes mostres de una partida d'escacs contra el propi GNU Chess ens ajuden a posar de relleu els avantatges i inconvenients de cada un dels algorismes proposats.

The Electoral Determinants of Collective Remittances: The Mexican 3x1 Program for Migrants

The 3x1 Program for Migrants is a matching grant scheme that seeks to direct the money sent by migrant organizations abroad to the provision of public and social infrastructure, and to productive projects in migrants’ communities of origin. To do so, the municipal, state, and federal administrations match the amount sent by hometown associations by 3 to 1. This opens the door to the political manipulation of the program. We explore the impact of a particular facet of Mexican political life on the operation of the 3x1: its recent democratization and the increasing political competition at the municipal level. Relying on the literature on redistributive politics, we posit that an increasing number of effective parties in elections may have two different effects. On the one hand, the need to cater to more heterogeneous constituencies may increase the provision of public projects. On the other hand, since smaller coalitions are needed to win elections under tighter competition, fewer public and more private (clientelistic) projects could be awarded. Using a unique dataset on the 3x1 Program for Migrants for over 2,400 municipalities in the period 2002 through 2007, we find a lower provision of public goods in electorally competitive jurisdictions. Thus, we remain sceptical about the program success in promoting public goods in politically competitive locations with high migration levels.

Disseny d'un Battle Chess 3D (2)

Aquesta memòria descriu el projecte de final de carrera anomenat "Disseny d’un Battle Chess 3D (2)", que tracta de la creació, modelat i animació de peces per a un joc d’escacs en 3 dimensions amb certes temàtiques, i que posteriorment s’integren amb el projecte "Disseny d’un Battle Chess 3D (1)" per a formar un joc interactiu d’escacs en un applet de Java. Es descriuen les eines utilitzades, les fases de creació, tècniques simbòliques, mètodes més emprats, proves sotmeses, limitacions, i finalment s’arriba una conclusió de treball aconseguit.

Including the workload effect in the parallel program signature

Performance prediction and application behavior modeling have been the subject of exten- sive research that aim to estimate applications performance with an acceptable precision. A novel approach to predict the performance of parallel applications is based in the con- cept of Parallel Application Signatures that consists in extract an application most relevant parts (phases) and the number of times they repeat (weights). Executing these phases in a target machine and multiplying its exeuction time by its weight an estimation of the application total execution time can be made. One of the problems is that the performance of an application depends on the program workload. Every type of workload affects differently how an application performs in a given system and so affects the signature execution time. Since the workloads used in most scientific parallel applications have dimensions and data ranges well known and the behavior of these applications are mostly deterministic, a model of how the programs workload affect its performance can be obtained. We create a new methodology to model how a program’s workload affect the parallel application signature. Using regression analysis we are able to generalize each phase time execution and weight function to predict an application performance in a target system for any type of workload within predefined range. We validate our methodology using a synthetic program, benchmarks applications and well known real scientific applications.

Open Chess Game Analyzer

Aquest document detalla la feina que s'ha dut a terme per desenvolupar el projecte Open Chess Game Analyzer. La finalitat del mateix és desenvolupar un aplicatiu lliure que sigui capaç d'analitzar partides d'escacs a partir d'un fitxer PGN.

Aplicació web per gestió de tornejos d'escacs amb J2EE

L'aplicació consisteix en un programa web que des d'un navegador ens permet realitzar una sèrie de consultes i de gestions contra una base de dades de tornejos d'escacs. Les gestions i consultes variaran segons el rol d'usuari sigui administrador, gestor o usuari Internet. Així, l'aplicació consta d'un servidor, una base de dades, unes classes entitat Java que treballaran a la capa de model per fer els canvis a la Base de dades, unes pàgines html i jsp, que estaran a la capa de vista, uns fitxers de configuració .xml i uns fitxers .java que actuaran a la capa de control. Els rols s'han implantat a nivell de servidor, amb una pàgina de login, i segons el rol escollit, es tindrà accés a una carpeta (zona) o altra.

A comment on the Nash program and the theory of implementation

The mechanisms in the Nash program for cooperative games are madecompatible with the framework of the theory of implementation. This is donethrough a reinterpretation of the characteristic function that avoids feasibilityproblems, thereby allowing an analysis that focuses exclusively on the payoff space. In this framework, we show that the core is the only majorcooperative solution that is Maskin monotonic. Thus, implementation of mostcooperative solutions must rely on refinements of the Nash equilibrium concept(like most papers in the Nash program do). Finally, the mechanisms in theNash program are adapted into the model.

Invariance and randomness in the Nash program for coalitional games

By introducing physical outcomes in coalitional games we note that coalitional games and social choice problems are equivalent (implying that so are the theory of implementation and the Nash program). This facilitates the understanding of the role of invariance and randomness in the Nash program. Also, the extent to which mechanisms in the Nash program perform ``real implementation'' is examined.

The impact of interest-rate subsidies on long-term household debt: Evidence from a large program

The responsiveness of long-term household debt to the interest rate is acrucial parameter for assessing the effectiveness of public policies aimedat promoting specific types of saving. This paper estimates the effect ofa reform of Credito Bonificado, a large program in Portugal that subsidizedmortgage interest rates, on long-term household debt. The reform establisheda ceiling in the price of the house that could be financed through theprogram, and provides plausibly exogenous variation in incentives. Usinga unique dataset of matched household survey data and administrative recordsof debt, we document a large decrease in the probability of signing a newloan after the removal of the subsidy.

An enhanced concave program relaxation for choice network revenue management

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

Stochastic evolution of rules for playing normal form games

The evolution of boundedly rational rules for playing normal form games is studied within stationary environments ofstochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal formgames that arise. It is shown that many of the folk results of evolutionary game theory typically obtained witha fixed game and fixed strategies carry over to the present case. The results are also related to recent experimentson rules and games.

Improving college access and success for low-income students: Evidence from a large need-based grant program

Using comprehensive administrative data on France's single largest financialaid program, this paper provides new evidence on the impact of large-scaleneed-based grant programs on the college enrollment decisions, persistenceand graduation rates of low-income students. We exploit sharp discontinuitiesin the grant eligibility formula to identify the impact of aid on student outcomesat different levels of study. We find that eligibility for an annual cashallowance of 1,500 euros increases college enrollment rates by up to 5 percentagepoints. Moreover, we show that need-based grants have positive effectson student persistence and degree completion.

Escacs, un sistema intel·ligent

Des dels inicis dels ordinadors com a màquines programables, l’home ha intentat dotar-los de certa intel•ligència per tal de pensar o raonar el més semblant possible als humans. Un d’aquests intents ha sigut fer que la màquina sigui capaç de pensar de tal manera que estudiï jugades i guanyi partides d’escacs. En l’actualitat amb els actuals sistemes multi tasca, orientat a objectes i accés a memòria i gràcies al potent hardware del que disposem, comptem amb una gran varietat de programes que es dediquen a jugar a escacs. Però no hi ha només programes petits, hi ha fins i tot màquines senceres dedicades a calcular i estudiar jugades per tal de guanyar als millors jugadors del món. L’objectiu del meu treball és dur a terme un estudi i implementació d’un d’aquests programes, per això es divideix en dues parts. La part teòrica o de l’estudi, consta d’un estudi dels sistemes d’intel•ligència artificial que es dediquen a jugar a escacs, estudi i cerca d’una funció d’avaluació vàlida i estudi dels algorismes de cerca. La part pràctica del treball es basa en la implementació d’un sistema intel•ligent capaç de jugar a escacs amb certa lògica. Aquesta implementació es porta a terme amb l’ajuda de les llibreries SDL, utilitzant l’algorisme minimax amb poda alfa-beta i codi c++. Com a conclusió del projecte m’agradaria remarcar que l’estudi realitzat m’ha deixat veure que crear un joc d’escacs no era tan fàcil com jo pensava però m’ha aportat la satisfacció d’aplicar tot el que he après durant la carrera i de descobrir moltes altres coses noves.