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.

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.

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.

From a pattern-language to a pattern ontology approach for CSCL script design

Collaborative activities, in which students actively interact with each other, have proved to provide significant learning benefits. In Computer-Supported Collaborative Learning (CSCL), these collaborative activities are assisted by technologies. However, the use of computers does not guarantee collaboration, as free collaboration does not necessary lead to fruitful learning. Therefore, practitioners need to design CSCL scripts that structure the collaborative settings so that they promote learning. However, not all teachers have the technical and pedagogical background needed to design such scripts. With the aim of assisting teachers in designing effective CSCL scripts, we propose a model to support the selection of reusable good practices (formulated as patterns) so that they can be used as a starting point for their own designs. This model is based on a pattern ontology that computationally represents the knowledge captured on a pattern language for the design of CSCL scripts. A preliminary evaluation of the proposed approach is provided with two examples based on a set of meaningful interrelated patters computationally represented with the pattern ontology, and a paper prototyping experience carried out with two teaches. The results offer interesting insights towards the implementation of the pattern ontology in software tools.

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.