Specifying and analysing networks of processes in CSPt (or in search of associativity)

In proposing theories of how we should design and specify networks of processes it is necessary to show that the semantics of any language we use to write down the intended behaviours of a system has several qualities. First in that the meaning of what is written on the page reflects the intention of the designer; second that there are no unexpected behaviours that might arise in a specified system that are hidden from the unsuspecting specifier; and third that the intention for the design of the behaviour of a network of processes can be communicated clearly and intuitively to others. In order to achieve this we have developed a variant of CSP, called CSPt, designed to solve the problems of termination of parallel processes present in the original formulation of CSP. In CSPt we introduced three parallel operators, each with a different kind of termination semantics, which we call synchronous, asynchronous and race. These operators provide specifiers with an expressive and flexible tool kit to define the intended behaviour of a system in such a way that unexpected or unwanted behaviours are guaranteed not to take place. In this paper we extend out analysis of CSPt and introduce the notion of an alphabet diagram that illustrates the different categories of events that can arise in the parallel composition of processes. These alphabet diagrams are then used to analyse networks of three processes in parallel with the aim of identifying sufficient constraints to ensure associativity of their parallel composition. Having achieved this we then proceed to prove associativity laws for the three parallel operators of CSPt. Next, we illustrate how to design and construct a network of three processes that satisfy the associativity law, using the associativity theorem and alphabet diagrams. Finally, we outline how this could be achieved for more general networks of processes.

Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions

CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.

Two-level Mapping Based Cache Index Selection for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the placement function to reduce conflict misses. Traditional placement functions use a one-level mapping that naively partitions trie-nodes into cache sets. However, as a significant percentage of trie nodes are not useful, these schemes suffer from a non-uniform distribution of useful nodes to sets. This in turn results in increased conflict misses. Newer organizations such as variable associativity caches achieve flexibility in placement at the expense of increased hit-latency. This makes them unsuitable for L1 caches.We propose a novel two-level mapping framework that retains the hit-latency of one-level mapping yet incurs fewer conflict misses. This is achieved by introducing a secondlevel mapping which reorganizes the nodes in the naive initial partitions into refined partitions with near-uniform distribution of nodes. Further as this remapping is accomplished by simply adapting the index bits to a given routing table the hit-latency is not affected. We propose three new schemes which result in up to 16% reduction in the number of misses and 13% speedup in memory access time. In comparison, an XOR-based placement scheme known to perform extremely well for general purpose architectures, can obtain up to 2% speedup in memory access time.

Toward a Scalable Working Set Size Estimation Method and Its Application for Chip Multiprocessors

It is essential to accurately estimate the working set size (WSS) of an application for various optimizations such as to partition cache among virtual machines or reduce leakage power dissipated in an over-allocated cache by switching it OFF. However, the state-of-the-art heuristics such as average memory access latency (AMAL) or cache miss ratio (CMR) are poorly correlated to the WSS of an application due to 1) over-sized caches and 2) their dispersed nature. Past studies focus on estimating WSS of an application executing on a uniprocessor platform. Estimating the same for a chip multiprocessor (CMP) with a large dispersed cache is challenging due to the presence of concurrently executing threads/processes. Hence, we propose a scalable, highly accurate method to estimate WSS of an application. We call this method ``tagged WSS (TWSS)'' estimation method. We demonstrate the use of TWSS to switch-OFF the over-allocated cache ways in Static and Dynamic NonUniform Cache Architectures (SNUCA, DNUCA) on a tiled CMP. In our implementation of adaptable way SNUCA and DNUCA caches, decision of altering associativity is taken by each L2 controller. Hence, this approach scales better with the number of cores present on a CMP. It gives overall (geometric mean) 26% and 19% higher energy-delay product savings compared to AMAL and CMR heuristics on SNUCA, respectively.

Desenvolvimento organizacional rural III: metodologia de intervencao de grupo em associacoes de agricultores de base familiar.

Uma metodologia de intervenção de grupo foi testada de grupo foi testada em 11 organizacoes rurais de base familiar, formada por nove associacoes de agricultores tradicionais, uma associacao de assentamento de reforma agraria e uma central de associacoes, sendo todas situadas em tres municipios do Estado de Goias. A metodologia constitui-se das seguintes etapas de intervencoes: apresentacao da proposta de trabalho, motivacao em nucleacao do grupo; diagnostico da organizacao; planejamento estrategico participativo (PEP), bem como a execução das propostas e acoes estrategicas; desenvolvimento e capacitacao dos agricultores e avaliação final da gestao das organizacoes. Este trabalho discutiu cada uma dessa etapas, e suas principais caracteristicas são: a construcao de objetivos compartilhados e a possibilidade de os membros da organização se desenvolverem como equipe trabalho e de participarem do desenvolvimento local. Dentre os resultados parciais obtidos ate o momento, destacaram-se: a producao e a comercializacao de doces e temperos caseiros; criacao e comercializacsao de frango caipira; implantacao de viveiro de mudas de plantas nativas; desenvolvimento de grupo de jovens rurais; implementacao de lavoura comunitaria, compra coletiva de produtos domesticos e insumos agricolas. Conclui-se que a referida metodologia favorece a dinamica do funcionamento das organizacoes rurais, mas não assegura a manutencao da coesao grupal, em caso de afastamento da equipe do projeto, no inicio de execução das propostas estrategicas, em face das dificuldades advindas do meio ambiente.

Automatic dimensional reduction and meshing of stiffened thin-wall structures

The creation of idealised, dimensionally reduced meshes for preliminary design and optimisation remains a time-consuming, manual task. A dimensionally reduced model is ideal for assessing design changes through modification of element properties without the need to create a new geometry or mesh. In this paper, a novel approach for automating the creation of mixed dimensional meshes is presented. The input to the process is a solid model which has been decomposed into a non-manifold assembly of smaller volumes with different meshing significance. Associativity between the original solid model and the dimensionally reduced equivalent is maintained. The approach is validated by means of a free-free modal analysis on an output mesh of a gas turbine engine component of industrial complexity. Extensions and enhancements to this work are also discussed.

Using mesh-geometry relationships to transfer analysis models between CAE tools

Integrating analysis and design models is a complex task due to differences between the models and the architectures of the toolsets used to create them. This complexity is increased with the use of many different tools for specific tasks using an analysis process. In this work various design and analysis models are linked throughout the design lifecycle, allowing them to be moved between packages in a way not currently available. Three technologies named Cellular Modeling, Virtual Topology and Equivalencing are combined to demonstrate how different finite element meshes generated on abstract analysis geometries can be linked to their original geometry. Cellular models allow interfaces between adjacent cells to be extracted and exploited to transfer analysis attributes such as mesh associativity or boundary conditions between equivalent model representations. Virtual Topology descriptions used for geometry clean-up operations are explicitly stored so they can be reused by downstream applications. Establishing the equivalence relationships between models enables analysts to utilize multiple packages for specialist tasks without worrying about compatibility issues or substantial rework.

Successful termination in timed CSP

In proposing theories of how we should design and specify networks of processes it is necessary to show that the semantics of any language we use to write down the intended behaviours of a system has several qualities. First in that the meaning of what is written on the page reflects the intention of the designer; second that there are no unexpected behaviours that might arise in a specified system that are hidden from the unsuspecting specifier; and third that the intention for the design of the behaviour of a network of processes can be communicated clearly and intuitively to others. In order to achieve this we have developed a variant of CSP, called CSPt, designed to solve the problems of termination of parallel processes present in the original formulation of CSP. In CSPt we introduced three parallel operators, each with a different kind of termination semantics, which we call synchronous, asynchronous and race. These operators provide specifiers with an expressive and flexible tool kit to define the intended behaviour of a system in such a way that unexpected or unwanted behaviours are guaranteed not to take place. In this paper we extend out analysis of CSPt and introduce the notion of an alphabet diagram that illustrates the different categories of events that can arise in the parallel composition of processes. These alphabet diagrams are then used to analyse networks of three processes in parallel with the aim of identifying sufficient constraints to ensure associativity of their parallel composition. Having achieved this we then proceed to prove associativity laws for the three parallel operators of CSPt. Next, we illustrate how to design and construct a network of three processes that satisfy the associativity law, using the associativity theorem and alphabet diagrams. Finally, we outline how this could be achieved for more general networks of processes.

An Interpolative Analytical Cache Model with Application to Performance-Power Design Space Exploration

Caches are known to consume up to half of all system power in embedded processors. Co-optimizing performance and power of the cache subsystems is therefore an important step in the design of embedded systems, especially those employing application specific instruction processors. In this project, we propose an analytical cache model that succinctly captures the miss performance of an application over the entire cache parameter space. Unlike exhaustive trace driven simulation, our model requires that the program be simulated once so that a few key characteristics can be obtained. Using these application-dependent characteristics, the model can span the entire cache parameter space consisting of cache sizes, associativity and cache block sizes. In our unified model, we are able to cater for direct-mapped, set and fully associative instruction, data and unified caches. Validation against full trace-driven simulations shows that our model has a high degree of fidelity. Finally, we show how the model can be coupled with a power model for caches such that one can very quickly decide on pareto-optimal performance-power design points for rapid design space exploration.

Coopetencia y modelos de asociatividad en colombia

El concepto de coopetencia surgen los planteamientos relacionados con los clústers y las redes empresariales, en donde empresas con características similares fortalecen sus relaciones para desarrollar mayores niveles de eficiencia o alcanzar objetivos que individualmente serian difíciles de lograr, especialmente en el caso de las pymes. Es fundamental que el estado desarrolle las relaciones y la conformación de iniciativas de asociatividad que permitan que la fluidez y los vínculos entre empresas, instituciones gubernamentales, financieras, universidades, centros de investigación, entre otros; para promover la integración de esfuerzos, la fluidez de información y el acceso a tecnologías, mejores posiciones competitivas. En Colombia desde hace aproximadamente 20 años, dentro de la política de competitividad del gobierno nacional (a partir del informe monitor), se ha identificado la importancia de las relaciones entre empresas e instituciones conexas para mejorar los estándares y la eficiencia que se pueda lograr para mantener una posición competitiva en los mercados internacionales.

“Municipio saludable como polo de desarrollo local” Caso Machetá

La Universidad del Rosario y la Gobernación de Cundinamarca realizaron un acuerdo con el fin de desarrollarlo en tres municipios: Machetá, Sesquilé y Mesitas de El Colegio, el Proyecto Municipio Saludable como Polo de Desarrollo Local, el cual tiene cuatro ejes. La Facultad de Administración implementa el Eje 1, que se relaciona con la generación de empleo e ingresos. La presente investigación se llevó a cabo en el Municipio de Machetá, y tuvo como objetivo evaluar y analizar las condiciones de los pequeños productores de papa en el municipio de Machetá. Es importante resaltar que en el lugar de estudio siempre se han presentado problemas de desarrollo a nivel económico que necesitan de una intervención. De esta manera surgió la idea de plantear un proyecto productivo para impulsar el sector primario en la región, para mejorar la calidad de vida de los sus familias papicultoras.

Redes organizacionales saludables

El entorno empresarial actual ha llevado a las empresas a adoptar nuevas estrategias para ingresar a nuevos mercados, logrando ser competitivos y productivos. Una de esas estrategias es la creación de las redes empresariales, que permite a las empresas apoyarse en otras con las que tienen un objetivo común. La asociatividad se ha consolidado como la forma más sencilla y practica de alcanzar mercados nuevos sin incurrir en muchos gastos o riesgos, sin que ello implique que los riesgos o gastos desaparezcan, si disminuyen de forma significativa. Por otro lado, las empresas también buscan ser saludables, esto a través de la implementación de programas y la adopción de nuevos criterios que les permita ser más competitivas y la vez poder aportar a sus empleados, sus proveedores y la comunidad. Buscan ser organizaciones que destaquen los aspectos positivos en sus organizaciones y mejorar las relaciones en todos los niveles.

Política de competitividad y productividad en la internacionalización de las Mipymes en Colombia

La investigación “Política de Competitividad y Productividad en la Internacionalización de las micro, pequeñas y medianas empresas (Mipymes) en Colombia”, tiene como objetivo analizar el impacto que han tenido los nuevos modelos de gestión empresarial planteados desde la Política de Productividad y Competitividad en Colombia; para modernizarlas y proyectarlas en un entorno globalizado de manera rentable y sostenible. Para cumplir con este objetivo, se realiza una investigación con fuentes primarias y secundarias, entrelazando un marco teórico en el contexto de la Mipyme en Colombia, una dinámica histórica del modo de hacer negocios, la Política de Competitividad y Productividad con sus retos de exportación en productos de valor agregado, y el desempeño productivo y competitivo del sistema empresarial colombiano. Bajo este panorama, se toman dos casos de estudio: el Clúster de la Moda de Bogotá y el Conglomerado Antioqueño, que permiten determinar factores de éxito o fracaso en el desempeño productivo y competitivo de empresas, donde los resultados obtenidos permiten evidenciar la importancia de los modelos asociativos en la gestión empresarial y cómo se desarrollan las empresas cuando se toman decisiones asumiendo posiciones de gestión gerencial.

Viabilidad de un consorcio de exportación en el sector del cuero, calzado y manufacturas en cuero en Bogotá D.C.

El trabajo que se desarrolla a continuación es el resultado de una investigación que se realizó con las empresas del sector del cuero, calzado y manufacturas en cuero, de la ciudad de Bogotá; con el fin de mostrar la viabilidad de estas empresas para unirse en un proyecto de asociatividad como lo es un consorcio de exportación. Los proyectos de asociatividad son una de las posibilidades que existe para poder enfrentar el comercio globalizado, donde las empresas aportan experiencia y productos de calidad para el mercado internacional. La investigación desarrolla una serie de pasos a seguir para que empresas del sector en estudio, se consoliden como una sola empresa con fines de exportación. El resultado de esta misma confirma que las empresas del sector en Bogotá, están dispuestas a comprometerse en estos procesos asociativos siempre y cuando se desarrollen objetivos claros de exportación y que el nivel de las empresas miembros sea similar.