Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Using Relationships for Matching Textual Domain Models with Existing Code

We address the task of mapping a given textual domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has applications in improving the understandability of an existing application, migrating it to a more flexible architecture, or integrating it with other related applications. We use the vector-space model to abstractly represent domain model elements as well as source-code artifacts. The key novelty in our approach is to leverage the relationships between source-code artifacts in a principled way to improve the mapping process. We describe experiments wherein we apply our approach to the task of matching two real, open-source applications to corresponding industry-standard domain models. We demonstrate the overall usefulness of our approach, as well as the role of our propagation techniques in improving the precision and recall of the mapping task.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Programming for parallel architectures that do not have a shared address space is extremely difficult due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and multiple GPUs, or a distributed-memory cluster are examples of such systems. Past works that try to automate data movement for distributed-memory architectures can lead to excessive redundant communication. In this paper, we propose an automatic data movement scheme that minimizes the volume of communication between compute devices in heterogeneous and distributed-memory systems. We show that by partitioning data dependences in a particular non-trivial way, one can generate data movement code that results in the minimum volume for a vast majority of cases. The techniques are applicable to any sequence of affine loop nests and works on top of any choice of loop transformations, parallelization, and computation placement. The data movement code generated minimizes the volume of communication for a particular configuration of these. We use a combination of powerful static analyses relying on the polyhedral compiler framework and lightweight runtime routines they generate, to build a source-to-source transformation tool that automatically generates communication code. We demonstrate that the tool is scalable and leads to substantial gains in efficiency. On a heterogeneous system, the communication volume is reduced by a factor of 11X to 83X over state-of-the-art, translating into a mean execution time speedup of 1.53X. On a distributed-memory cluster, our scheme reduces the communication volume by a factor of 1.4X to 63.5X over state-of-the-art, resulting in a mean speedup of 1.55X. In addition, our scheme yields a mean speedup of 2.19X over hand-optimized UPC codes.

LDPC Code Designs Based on root I Matrices

LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.

An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations

The Lattice-Boltzmann method (LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a state-of-the-art LBM solver such as Palabos, a user has to still manually write the program using library-supplied primitives. We propose an automated code generator for a class of LBM computations with the objective to achieve high performance on modern architectures. Few studies have looked at time tiling for LBM codes. We exploit a key similarity between stencils and LBM to enable polyhedral optimizations and in turn time tiling for LBM. We also characterize the performance of LBM with the Roofline performance model. Experimental results for standard LBM simulations like Lid Driven Cavity, Flow Past Cylinder, and Poiseuille Flow show that our scheme consistently outperforms Palabos-on average by up to 3x while running on 16 cores of an Intel Xeon (Sandybridge). We also obtain an improvement of 2.47x on the SPEC LBM benchmark.

Evaluación de Rhizobium tropici UMR 1899 en tres variedades de frijol común (Phaseolus vulgaris L.) y la extracción de macronutrientes primarios por el cultivo

El presente trabajo fue realizado en la finca experimental La Compañía, Carazo, en época de postrera (octubre- diciembre de 1996), en suelos jóvenes de origen volcánico con altos contenidos de potasio y deficiente de fósforo. El propósito del experimento fue determinar la influencia de dos tipos de Rhizobium en tres variedades de frijol común (Phaseolus vulgaris L.), sobre la producción de materia seca y rendimiento, así como la extracción de los elementos mayores tales como N, P y K. Las variedades evaluadas fueron: Honduras - 46, DOR - 364 y Revolución - 79 y los tipos de Rhizobium evaluados fueron: Rhizobium tropici UMR 1899 y la bacteria nativa Rhizobium leguminosarum bv phaseoli. El diseño utilizado fue bloques completos al azar (B.C.A), con seis tratamientos y cuatro repeticiones. Las variables evaluadas fueron: altura de planta, número de nódulos, peso seco de nódulos, peso seco de cada nódulo, materia seca, densidad de plantas por hectárea, número de vainas por planta, número de granos por vaina, peso de 100 granos, rendimiento y extracciones de macronutrientes como N, P y K. Los datos se procesaren usando análisis de varianza (ANDEVA) y se utilizó la prueba de rangos múltiples de DUNCAN (Ps0.05). Los resultados obtenidos se pueden sintetizar de la siguiente forma: la variedad Honduras - 46, presentó mayor producción de materia seca en los tejidos del follaje (1563.23 kg/ha), así como también obtuvo el mayor rendimiento (1 000.51 kg/ha), la variedad Revolución - 79 obtuvo la mayor producción de materia seca en los tejidos de la raíz (117.91 Kg/ha). La variedad DOR - 364 obtuvo la mayor extracción de macro nutrientes primarios (67.12 kg/ha de nitrógeno, 6.90 kg/ha de fósforo y 60.91 kg/ha de potasio). La bacteria nativa Rhlzobium leguminosarum bv phaseoli obtuvo la mayor producción de materia seca en los tejidos del follaje y la raíz, asi como en el rendimiento y extracciones totales de macronutrientes primarios.

Sistemas de justiça criminal : Brasil e Alemanha

Apresenta um estudo comparativo entre o sistema de justiça criminal do Brasil e o da Alemanha e suas implicações nos cenários institucional, jurídico e econômico. Analisa a relação entre os diversos tribunais existentes na Alemanha e o sistema brasileiro.

Região occidental de Matto Grosso : viagem e estudos sobre o Valle do Baixo Guaporé : da cidade de Matto Grosso ao Forte de Principe da Beira pelo Dr. Manoel Esperidião da Costa Marques, 1906. A seguir : Projectos de vias de communicação : exploração do Alto Guaporé e dos rios Jaurú, Aguapehy e Alegre : do mesmo autor, 1899

Apontamentos, notas e narrativas sobre o vale do Baixo Guaporé, com detalhes sobre riqueza, civilização, indústria, comércio, população, comunidades indígenas, usos e costumes.