11677088
Owner Prediction for Accelerating Cache-to-Cache Transfer Misses in a cc-NUMA Architecture
Cache misses for which data must be obtained from a remote cache (cache-to-cache transfer misses) account for an important fraction of the total miss rate. Unfortunately, cc-NUMA designs put the access to the directory information into the critical path of 3-hop misses, which significantly penalizes them compared to SMP designs. This work studies the use of owner prediction as a means of providing cc-NUMA multiprocessors with a more efficient support for cache-to-cache transfer misses. Our proposal comprises an effective prediction scheme as well as a coherence protocol designed to support the use of prediction. Results indicate that owner prediction can significantly reduce the latency of cache-to-cache transfer misses, which translates into speed-ups on application performance up to 12%. In order to also accelerate most of those 3-hop misses that are either not predicted or mispredicted, the inclusion of a small and fast directory cache in every node is evaluated, leading to improvements up to 16% on the final performance.
16699598
Design and implementation requirements for CORBA lightweight components
This paper describes the guidelines we followed and the requirements we stated while designing and implementing the CORBA Lightweight Components (CORBA-/spl Lscr/C) Component Model. CORBA-/spl Lscr/C is a lightweight distributed reflective component model based on CORBA. Instead of using a traditional client/server model, it imposes a peer network model in which the whole network act as a repository for managing and assigning the whole set of resources: components, CPU cycles, memory, etc. Thus, application deployment is automatically and adaptively performed at run-time. Requirements for component description, packaging, deployment, reflection, logical network cohesion, distributed resource queries and fault-tolerant protocols are identified. Finally, we show the validity of the identified requirements in dealing with CSCW and Grid Computing applications and show how current component models fail on addressing some of these requirements.
16999625
Memory Subsystem Characterization in a 16-Core Snoop-Based Chip-Multiprocessor Architecture
In this paper we present an exhaustive evaluation of the memory subsystem in a chip-multiprocessor (CMP) architecture composed of 16 cores. The characterization is performed making use of a new simulator that we have called DCMPSIM and extends the Rice Simulator for ILP Multiprocessors (RSIM) with the functionality required to model a contemporary CMP in great detail. 
 
To better understand the behavior of the memory subsystem, we propose a taxonomy of the L1 cache misses found in CMPs which subsequently we use to determine where the hot spots of the memory hierarchy are and, thus, where computer architects have to place special emphasis to improve the performance of future dense single-chip multiprocessors, which will integrate 16 or more processor cores.
9781969
CORBA Lightweight Components : A Model for Distributed Component-BasedHeterogeneous Computation
In this article we present CORBA Lightweight Components, CORBA-LC, a new network-centered reflective component model which allows building distributed applications assembling binary independent components spread on the network. It provides a peer network view in which the component dependencies are managed automatically to perform an intelligent application run-time deployment, leading to better utilization of resources. We show the validity of the CORBA-LC approach in dealing with CSCW and Grid Computing applications.
15414881
Improving the Performance of Scientific Parallel Applications in a Cluster of Workstations
Recent improvements in LANs make network of workstations a good alternative to traditional parallel computers in some applications. However, in this platform the communication performance is over two orders of magnitude inferior to state-of-art multiprocessors. Currently networking technologies have put the pressure in the software overhead. Because of this, applications could not take advantage of this communication performance potential. In this paper, we present an implementation of Virtual Circuit Caching that reduces the software overhead by allocating communication resource once and re-using them for multiple messages to the same destinations. With this approach, the communication overhead is reduced by approximately a 35% for long messages; this reduction should enable the extensive use of networks of workstations for scientific parallel applications.
7433683
Viral systems: A new bio-inspired optimisation approach
The paper presents a new approach to deal with combinatorial problems. It makes use of a biological analogy inspired by the performance of viruses. The replication mechanism, as well as the hosts' infection processes is used to generate a metaheuristic that allows the obtention of valuable results. The viral system (VS) theoretical context is described and it is applied to a library of medium-to-large-sized cases of the Steiner problem for which the optimal solution is known. The method is compared with the metaheuristics that have provided the best results for the Steiner problem. The VS provides better solutions than genetic algorithms and certain tabu search approaches. For the most sophisticated tabu search approaches (the best metaheuristic approximations to the Steiner problem solution) VS provides solutions of similar quality.
206167311
Genetic algorithm for planning cable telecommunication networks
Abstract Optical fiber networks over synchronous digital hierarchy operating on ATM mode appear as one of the best alternatives for the new high-speed telecommunications networks. The network management requires planning studies so that the designed networks allow efficient operation in real time. A quantitative model evaluating the global topological design of an optical fiber network over synchronous digital hierarchy is described. The model includes the economic aspects involved in the project, the civil works, the capacity evaluation costs and the introduction of reliability conditions. A genetic approach based on the exploitation of the Kuhn–Tucker optimality conditions is proposed to solve the model.
32057483
An Evolutionary Algorithm for the Design of Hybrid Fiber Optic-Coaxial Cable Networks in Small Urban Areas
Telecommunication is one of the fastest growing business sectors. Future networks will need to integrate a wide variety of services demanding different qualities and capacities from the network. In this paper, network architecture based on hybrid fiber optic-coaxial cable (HFC) is proposed to develop cable integrated telematic services. An evolutionary algorithm is presented to solve the problem in suitable computation times when dealing with real times civil works problems. Finally we present the results over both problem library and real life scenarios.