A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.

ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.

Condiciones asistenciales y administrativas que potencialmente influirían en la satisfacción del cliente interno y externo de un servicio de salud: Implicaciones para la gestión operacional

Calidad en salud y Satisfacción en salud son dos fenómenos de naturaleza distinta, sin embargo la literatura reporta que en las mediciones de ambas parecen evaluarse factores similares en la prestación de los servicios de salud. La calidad en salud hace referencia a las ¨creencias que como forma de la percepción forman parte de la cognición mientras que la satisfacción concebida como un juicio de valor positivo o negativo que construye el sujeto que ha recibido el servicio de acuerdo al cumplimiento de sus expectativas, es considerada uno de los principales objetivos de la calidad de atención en salud y un indicador del óptimo funcionamiento de las instituciones hospitalarias, así entonces, el objetivo de este estudio fue determinar cuáles son las características asistenciales y administrativas que potencialmente influirían en la valoración de la satisfacción del usuario y funcionario frente a la atención en los servicios de salud del Hospital Municipal del Guamo-Tolima, mediante la identificación, medición y descripción de las mismas .Los resultados del estudio obtenidos a partir de la comparación de medias de cada uno de los ítems evaluados, y de la diferencia significativa de medias, mostraron que existen diferencias significativas entre la importancia asignada por los usuarios frente a la asignada por los funcionarios.

Aprofitament de residus vegetals per a la concentració i separació d'ions metàl·lics de solucions aquoses

La adsorció sobre carbó actiu és un tractament habitual para a l'eliminació de metalls contaminants d'afluents aquosos. Amb la finalitat de reduir el cost dels tractament actuals s'està estudiant la utilització d'adsorbents de baix cost com a substituts dels sorbents convencionals que s'utilitzen usualment en els tractaments d'aigües. En aquesta tesi s'ha avaluat la possibilitat d'aprofitar diversos residus vegetals procedents de processos agrícoles o residus industrials, com a sorbents per a l'eliminació de metalls de solucions aquoses. En concret, el treball s'ha centrat en assolir dos grans objectius, primer de tot, conèixer la possibilitat d'utilitzar el pinyol d'oliva com a adsorbent de metalls divalents de solucions aquoses, com són el Cd(II), Cu(II), Ni(II) i Pb(II), i en segon lloc, avaluar la utilització de quatre residus vegetals (escorça de yohimbe, rapa de raïm, suro i pinyol d'oliva) per a l'extracció de Cr(VI) de solucions aquoses i utilitzar el residu vegetal més apropiat com a base per tal d'obtenir un nou sorbent, amb més bona morfologia per ser utilitzat en sistemes d'eliminació de Cr(VI) en continu. Les dades cinètiques d'adsorció es van tractar amb el model cinètic de pseudo-segon ordre, amb el que es van determinar la velocitat inicial d'adsorció dels metalls. Els models d'isotermes d'equilibri de Langmuir i Freundlich es van utilitzar per descriure els equilibris d'adsorció i calcular els paràmetres de les isotermes. En els assajos amb mescles binàries de metalls, els resultats es van tractar amb el model ampliat de Langmuir. En aquest treball s'ha determinat, primerament, que el pinyol d'oliva és un bon sorbent dels metalls divalents estudiats. S'ha determinat que l'adsorció dels metalls varia amb el pH de la solució i que la presència de sals en la solució provoca una davallada en l'adsorció. També es va determinar la competència en l'adsorció entre els metalls al realitzar assajos en mescles binàries. Amb els estudis d'extracció de Cr(VI) amb els quatre materials s'ha determinat que aquests vegetals poden adsorbir el Cr(VI) en solució, tot i que la rapa i la yohimbe són els materials que presenten unes capacitats d'adsorció més elevades. Les anàlisis amb espectroscòpia electrònica de Raig-X realitzats en la rapa de raïm i la yohimbe en contacte amb Cr(VI) varen demostrar la presència del metall en els dos estats d'oxidació, Cr(VI) i Cr(III), evidenciant la participació del mecanisme de reducció de Cr(VI) en l'adsorció del metall sobre els materials. Amb l'encapsulació de la rapa de raïm es va incrementar significativament la capacitat d'adsorció del metall respecta a la seva utilització en la forma original. Les dades experimentals es van tractar amb un model de difusió i es va determinar el coeficient de difusió en l'adsorció en el sorbent amb diferent percentatge de rapa en l'interior. Finalment s'han realitzat estudis preliminars d'adsorció de crom hexavalent en continu utilitzant columnes de petites dimensions farcides amb el sorbent format per boles de rapa encapsulada en alginat càlcic. En aquests assajos s'ha determinat l'efecte en l'adsorció de metall de diversos paràmetres d'operació, com la concentració inicial de metall, el cabal i l'alçada de llit. El model de transferència de matèria i difusió en columna emprat pel tractament de les dades experimentals va mostrar l'efecte de la concentració inicial i del cabal en els coeficients de difusió i transferència de matèria. El model BDST no va predir correctament el temps de servei en els diferents paràmetres d'operació experimentats a causa de la complexitat del procés d'adsorció. Amb aquests assajos preliminars s'han establert les bases de l'adsorció de Cr(VI) amb el nou sorbent en sistemes en continu amb la finalitat de realitzar estudis posteriors d'eliminació del metall en columnes de majors dimensions.

Farming systems methodology for efficient resource management at the farm level: a review from an Indian perspective

Farming systems research is a multi-disciplinary holistic approach to solve the problems of small farms. Small and marginal farmers are the core of the Indian rural economy Constituting 0.80 of the total farming community but possessing only 0.36 of the total operational land. The declining trend of per capita land availability poses a serious challenge to the sustainability and profitability of farming. Under such conditions, it is appropriate to integrate land-based enterprises such as dairy, fishery, poultry, duckery, apiary, field and horticultural cropping within the farm, with the objective of generating adequate income and employment for these small and marginal farmers Under a set of farm constraints and varying levels of resource availability and Opportunity. The integration of different farm enterprises can be achieved with the help of a linear programming model. For the current review, integrated farming systems models were developed, by Way Of illustration, for the marginal, small, medium and large farms of eastern India using linear programming. Risk analyses were carried out for different levels of income and enterprise combinations. The fishery enterprise was shown to be less risk-prone whereas the crop enterprise involved greater risk. In general, the degree of risk increased with the increasing level of income. With increase in farm income and risk level, the resource use efficiency increased. Medium and large farms proved to be more profitable than small and marginal farms with higher level of resource use efficiency and return per Indian rupee (Rs) invested. Among the different enterprises of integrated farming systems, a chain of interaction and resource flow was observed. In order to make fanning profitable and improve resource use efficiency at the farm level, the synergy among interacting components of farming systems should be exploited. In the process of technology generation, transfer and other developmental efforts at the farm level (contrary to the discipline and commodity-based approaches which have a tendency to be piecemeal and in isolation), it is desirable to place a whole-farm scenario before the farmers to enhance their farm income, thereby motivating them towards more efficient and sustainable fanning.

Analysis of the calving pattern of herds in small-scale dairy systems in central Mexico

This study sets out to find the best calving pattern for small-scale dairy systems in Michoacan State, central Mexico. Two models were built. First, a linear programming model was constructed to optimize calving pattern and herd structure according to metabolizable energy availability. Second, a Markov chain model was built to investigate three reproductive scenarios (good, average and poor) in order to suggest factors that maintain the calving pattern given by the linear programming model. Though it was not possible to maintain the optimal linear programming pattern, the Markov chain model suggested adopting different reproduction strategies according to period of the year that the cow is expected to calve. Comparing different scenarios, the Markov model indicated the effect of calving interval on calving pattern and herd structure.

An approach for solving the lot-sizing problem of a market-driven foundry

Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. Journal of the Operational Research Society (2010) 61, 108-114. doi:10.1057/jors.2008.151

Modelo de programação linear para seleção de pulverizadores agrícolas de barras

A seleção de pulverizadores agrícolas que se adaptem às necessidades da propriedade, é um processo trabalhoso, sendo uma das etapas mais importantes dentro do processo produtivo. O objetivo do presente trabalho foi o de desenvolver e utilizar um modelo de programação linear para auxiliar na seleção de pulverizadores agrícolas de barras, baseado no menor custo horário do equipamento. Foram utilizadas as informações técnicas referentes a 20 modelos de pulverizadores disponíveis no mercado, sendo quatro autopropelidos, oito de arrasto e oito do tipo montado. A análise de sensibilidade dos componentes dos custos operacionais mostrou que as taxas de reparo e depreciação foram os fatores que mais interferiram na variação do custo horário do conjunto trator-pulverizador. O modelo matemático desenvolvido facilitou a realização da análise de sensibilidade que foi processada em um tempo muito pequeno.

Escalabilidade Paralela de um Algoritmo de Migração Reversa no Tempo (RTM) Pré-empilhamento

The seismic method is of extreme importance in geophysics. Mainly associated with oil exploration, this line of research focuses most of all investment in this area. The acquisition, processing and interpretation of seismic data are the parts that instantiate a seismic study. Seismic processing in particular is focused on the imaging that represents the geological structures in subsurface. Seismic processing has evolved significantly in recent decades due to the demands of the oil industry, and also due to the technological advances of hardware that achieved higher storage and digital information processing capabilities, which enabled the development of more sophisticated processing algorithms such as the ones that use of parallel architectures. One of the most important steps in seismic processing is imaging. Migration of seismic data is one of the techniques used for imaging, with the goal of obtaining a seismic section image that represents the geological structures the most accurately and faithfully as possible. The result of migration is a 2D or 3D image which it is possible to identify faults and salt domes among other structures of interest, such as potential hydrocarbon reservoirs. However, a migration fulfilled with quality and accuracy may be a long time consuming process, due to the mathematical algorithm heuristics and the extensive amount of data inputs and outputs involved in this process, which may take days, weeks and even months of uninterrupted execution on the supercomputers, representing large computational and financial costs, that could derail the implementation of these methods. Aiming at performance improvement, this work conducted the core parallelization of a Reverse Time Migration (RTM) algorithm, using the parallel programming model Open Multi-Processing (OpenMP), due to the large computational effort required by this migration technique. Furthermore, analyzes such as speedup, efficiency were performed, and ultimately, the identification of the algorithmic scalability degree with respect to the technological advancement expected by future processors

Primary power distribution systems planning taking into account reliability, operation and expansion costs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Modelo de programação matemática para controle do crescimento da vegetação sob redes de distribuição de energia elétrica

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Projeto de Sistemas Integrados de Propósito Geral Baseados em Redes em Chip Expandindo as Funcionalidades dos Roteadores para Execução de Operações: A plataforma IPNoSys

It bet on the next generation of computers as architecture with multiple processors and/or multicore processors. In this sense there are challenges related to features interconnection, operating frequency, the area on chip, power dissipation, performance and programmability. The mechanism of interconnection and communication it was considered ideal for this type of architecture are the networks-on-chip, due its scalability, reusability and intrinsic parallelism. The networks-on-chip communication is accomplished by transmitting packets that carry data and instructions that represent requests and responses between the processing elements interconnected by the network. The transmission of packets is accomplished as in a pipeline between the routers in the network, from source to destination of the communication, even allowing simultaneous communications between pairs of different sources and destinations. From this fact, it is proposed to transform the entire infrastructure communication of network-on-chip, using the routing mechanisms, arbitration and storage, in a parallel processing system for high performance. In this proposal, the packages are formed by instructions and data that represent the applications, which are executed on routers as well as they are transmitted, using the pipeline and parallel communication transmissions. In contrast, traditional processors are not used, but only single cores that control the access to memory. An implementation of this idea is called IPNoSys (Integrated Processing NoC System), which has an own programming model and a routing algorithm that guarantees the execution of all instructions in the packets, preventing situations of deadlock, livelock and starvation. This architecture provides mechanisms for input and output, interruption and operating system support. As proof of concept was developed a programming environment and a simulator for this architecture in SystemC, which allows configuration of various parameters and to obtain several results to evaluate it

Avaliação da execução de aplicações orientadas à dados na arquitetura de redes em chip IPNoSys

The increasing complexity of integrated circuits has boosted the development of communications architectures like Networks-on-Chip (NoCs), as an architecture; alternative for interconnection of Systems-on-Chip (SoC). Networks-on-Chip complain for component reuse, parallelism and scalability, enhancing reusability in projects of dedicated applications. In the literature, lots of proposals have been made, suggesting different configurations for networks-on-chip architectures. Among all networks-on-chip considered, the architecture of IPNoSys is a non conventional one, since it allows the execution of operations, while the communication process is performed. This study aims to evaluate the execution of data-flow based applications on IPNoSys, focusing on their adaptation against the design constraints. Data-flow based applications are characterized by the flowing of continuous stream of data, on which operations are executed. We expect that these type of applications can be improved when running on IPNoSys, because they have a programming model similar to the execution model of this network. By observing the behavior of these applications when running on IPNoSys, were performed changes in the execution model of the network IPNoSys, allowing the implementation of an instruction level parallelism. For these purposes, analysis of the implementations of dataflow applications were performed and compared

Uma abordagem fuzzy para a avaliação técnico-econômica de redes de acesso

O surgimento de novas tecnologias e serviços vem impondo mudanças substanciais ao tradicional sistema de telecomunicações. Múltiplas possibilidades de evolução do sistema fazem da etapa de planejamento um procedimento não só desejável como necessário, principalmente num ambiente de competitividade. A utilização de metodologias abrangentes e flexíveis que possam auxiliar no processo de decisão, fundadas em modelos de otimização, parece um caminho inevitável. Este artigo propõe um modelo de programação linear inteiro misto para ajudar no planejamento estratégico de sistemas de telecomunicações, e em particular da rede de acesso. Os principais componentes de custo e receita são identificados e o modelo é desenvolvido para determinar a configuração da rede (serviços, tecnologias, etc) que maximize a receita esperada pelo operador do sistema. O conceito de números fuzzy é adotado para avaliar o risco técnico-econômico em situações de imprecisão nos dados de demanda. Resultados de experimentos computacionais são apresentados e discutidos.