In this thesis we propose to realize the performance benefits of applicationspecific hardware optimizations in a general-purpose, multi-user system environment using a dynamically extensible microprocessor architecture. We have called our dynamically extensible microprocessor design the Extensible Microprocessor without Interlocked Pipeline Stages, or eMIPS. The eMIPS architecture uses the interaction of fixed and configurable logic available in modern Field Programmable Gate Array (FPGA). This interaction is used to address the limitations of current microprocessor architectures based solely on Application Specific Integrated Circuits (ASIC). These limitations include inflexibility, size, and application specific performance optimization. The eMIPS system allows multiple secure extensions to load dynamically and to plug into the stages of a pipelined central processing unit (CPU) data path, thereby extending the core instruction set of the microprocessor. Extensions can also be used to realize on-chip peripherals, and if area permits, even multiple cores. Extension instructions reduce dramatically the execution time of frequently executed instruction patterns. These new functionalities we have developed can be exploited by patching the binaries of existing applications, without any changes to the compilers. A FPGA based workstation prototype and a flexible simulation system implementating this design demonstrates speedups of 2x-3x on a set of applications that include video games, real-time programs and the SPEC2000 integer benchmarks. eMIPS is the first realized workstation based entirely on a dynamically extensible microprocessor that is safe for general purpose, multi-user applications. By exposing the individual stages of the data path, eMIPS allows optimizations not previously possible. This includes permitting safe and coherent accesses to memory from within an extension, optimizing multi-branched blocks, and throwing precise and restart able exceptions from within an extension. This work describes a simplified implementation of an extensible microprocessor architecture based on the Microprocessor without Interlocked Pipeline Stages (MIPS) Reduced Instruction Set Computer (RISC) architecture. The concepts and methods contained within this thesis may be applied to other similar architectures. Given this simplified prototype we look forward to propose how this architecture will be expanded as it matures.

The switched telephony network was designed for voice calls. Expansion of datacommunication has lead to a wide range of experimentation to create new services. Theses services take place outside the network. When adding new services we currently encounter problems due to limitations of the simple devices at end points. Theo Kanter has proposed a new model to remove these limitations; this model is called “Adaptive Personal Mobile Communication”. The model consists of several components in the application layer of ISO standard. This model is based on peer to peer connections and the purpose of this model is to move services from within the networks to end point devices and avoid using central servers within the network. The Session Initiation Protocol (SIP) for establishing multimedia sessions allows us to move the point of integration for multimedia service integration out to the end-points. This project concerns the implementing of a prototype of this model as an SIP extension along with it evaluation. SIP offer addressing, naming, and localization of resources in this project. This report presents different design alternatives for XSP as an SIP extension, and the chosen model presents as a result of comparing of these design alternatives.

No description available.

Made available in DSpace on 2015-03-04T18:51:20Z (GMT). No. of bitstreams: 1 Trenhago2.pdf: 15966707 bytes, checksum: 00c5e69b3e4ccb8745765adf1d2fa0a8 (MD5) Previous issue date: 2009-03-23 / Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior / This work describes the development of a software structure that currently controls the CAVE at LNCC, as well as its use for biological data visualization. This work also includes the adaptation and configuration of the InstantReality framework considering all particularities of the CAVE built at LNCC, which amongst other things does not have square walls all around (two walls have a particular shape). In order to accompish this task we make use of the emerging X3D technology. This work also proposes a process for fast development of biological data visualization. Such process has been used to develop a series of sample applications, which included geometric description of parts of the human cardiovascular system as well as other structures such as parts of worms and other creatures, visualization of proteine models and virus envelops both relying or not on some programming language. This work also introduces important aspects of complex surface visualization and describes the implementation of a GPU based ilumination model. Additionally, some justifications are presented regarding the use of Virtual Reality as a tool for bioinformatics visuzalization or biologic applications. Finally, this work evaluates the CAVE prototype, considering each of its components, in the light of the results achieved in the biologic visualization applications developed. Problems are identified and further improvements are proposed. / Este trabalho descreve o desenvolvimento de uma estrutura lógica de software para o controle do CAVE do LNCC e sua utilização na visualização de dados biológicos. Configuramos e adaptamos o framework InstantReality para fazer funcionar todos os componentes singulares do CAVE do LNCC ( uma parede não ortogonal, duas paredes com cinco lados, projetores convencionais, entre outros ) por meio de uma tecnologia emergente, o X3D, usado para distribuir conteúdo 3D multimídia pela Internet. Propomos um processo para o rápido desenvolvimento, recorrendo ou não a uma linguagem de programação, de aplicações para visualização de dados biológicos, tais como: descrição geométrica de parte do sistema cardiovascular humano, de parte de uma larva, visualização de modelos de proteínas e capsídios de vírus. Apresentamos questões importantes na visualização de superfícies complexas, como a importância do modelo de iluminação utilizado e descrevemos a implementação de um modelos de iluminação em GPU. Adicionalmente, justificamos o emprego da Realidade Virtual como ferramenta valiosa para a visualização em bioinformática, e mesmo na biologia. Finalmente, avaliamos a eficiência geral do CAVE e de cada componente,através dos resultados obtidos na visualização de cenários temáticos de interesse biológico. Identificamos possíveis problemas e sugerimos opções para uma melhoria geral do desempenho.

Statische Codemetriken sind wichtige Indikatoren für die Qualität eines Softwaresystems. Sie beleuchten dabei unterschiedliche Aspekte eines Softwaresystems. Deshalb ist es notwendig, mehrere Codemetriken zu nutzen, um die Qualität eines Softwaresystems in seiner Gesamtheit bewerten zu können. Wünschenswert wäre zudem eine Darstellung, die die Struktur des Gesamtsystems und die Bewertung einzelner Elemente eines Softwaresystems in einer Darstellung kombiniert. Die Arbeit untersucht deshalb, welche Metaphern geeignet sind, um eine solche Darstellung zu ermöglichen. Ein zweites Ziel der Arbeit war es, eine solche Visualisierung automatisch erzeugen zu können. Dafür wurde ein Generator entwickelt, der diese Anforderung erfüllt. Zur Konzeption dieses Generators kamen Techniken aus der generativen Softwareentwicklung zum Einsatz. Bei der Umsetzung des Generators wurde auf Techniken aus der modellgetriebenen Softwareentwicklung zurückgegriffen, vor allem auf Techniken aus dem openArchitectureWare-Framework. Der Generator kann in Eclipse eingebunden werden und ist in der Lage, aus einem Java-Projekt die Struktur und die Metrikwerte automatisch zu extrahieren. Diese Werte werden daraufhin in ein dreidimensionales Modell überführt, das auf dem offenen Extensible 3D Standard basiert. Der Generator ermöglichte zudem die Evaluierung zweier unterschiedlicher Metaphern, die im Rahmen der Arbeit durchgeführt wurde.

Este trabalho descreve o desenvolvimento de uma estrutura lógica de software para o controle do CAVE do LNCC e sua utilização na visualização de dados biológicos. Configuramos e adaptamos o framework InstantReality para fazer funcionar todos os componentes singulares do CAVE do LNCC ( uma parede não ortogonal, duas paredes com cinco lados, projetores convencionais, entre outros ) por meio de uma tecnologia emergente, o X3D, usado para distribuir conteúdo 3D multimídia pela Internet. Propomos um processo para o rápido desenvolvimento, recorrendo ou não a uma linguagem de programação, de aplicações para visualização de dados biológicos, tais como: descrição geométrica de parte do sistema cardiovascular humano, de parte de uma larva, visualização de modelos de proteínas e capsídios de vírus. Apresentamos questões importantes na visualização de superfícies complexas, como a importância do modelo de iluminação utilizado e descrevemos a implementação de um modelos de iluminação em GPU. Adicionalmente, justificamos o emprego da Realidade Virtual como ferramenta valiosa para a visualização em bioinformática, e mesmo na biologia. Finalmente, avaliamos a eficiência geral do CAVE e de cada componente,através dos resultados obtidos na visualização de cenários temáticos de interesse biológico. Identificamos possíveis problemas e sugerimos opções para uma melhoria geral do desempenho. / This work describes the development of a software structure that currently controls the CAVE at LNCC, as well as its use for biological data visualization. This work also includes the adaptation and configuration of the InstantReality framework considering all particularities of the CAVE built at LNCC, which amongst other things does not have square walls all around (two walls have a particular shape). In order to accompish this task we make use of the emerging X3D technology. This work also proposes a process for fast development of biological data visualization. Such process has been used to develop a series of sample applications, which included geometric description of parts of the human cardiovascular system as well as other structures such as parts of worms and other creatures, visualization of proteine models and virus envelops both relying or not on some programming language. This work also introduces important aspects of complex surface visualization and describes the implementation of a GPU based ilumination model. Additionally, some justifications are presented regarding the use of Virtual Reality as a tool for bioinformatics visuzalization or biologic applications. Finally, this work evaluates the CAVE prototype, considering each of its components, in the light of the results achieved in the biologic visualization applications developed. Problems are identified and further improvements are proposed.

Statische Codemetriken sind wichtige Indikatoren für die Qualität eines Softwaresystems. Sie beleuchten dabei unterschiedliche Aspekte eines Softwaresystems. Deshalb ist es notwendig, mehrere Codemetriken zu nutzen, um die Qualität eines Softwaresystems in seiner Gesamtheit bewerten zu können. Wünschenswert wäre zudem eine Darstellung, die die Struktur des Gesamtsystems und die Bewertung einzelner Elemente eines Softwaresystems in einer Darstellung kombiniert. Die Arbeit untersucht deshalb, welche Metaphern geeignet sind, um eine solche Darstellung zu ermöglichen. Ein zweites Ziel der Arbeit war es, eine solche Visualisierung automatisch erzeugen zu können. Dafür wurde ein Generator entwickelt, der diese Anforderung erfüllt. Zur Konzeption dieses Generators kamen Techniken aus der generativen Softwareentwicklung zum Einsatz. Bei der Umsetzung des Generators wurde auf Techniken aus der modellgetriebenen Softwareentwicklung zurückgegriffen, vor allem auf Techniken aus dem openArchitectureWare-Framework. Der Generator kann in Eclipse eingebunden werden und ist in der Lage, aus einem Java-Projekt die Struktur und die Metrikwerte automatisch zu extrahieren. Diese Werte werden daraufhin in ein dreidimensionales Modell überführt, das auf dem offenen Extensible 3D Standard basiert. Der Generator ermöglichte zudem die Evaluierung zweier unterschiedlicher Metaphern, die im Rahmen der Arbeit durchgeführt wurde.

Dans cette thèse, nous étudions trois catégories de problèmes : les d-extensibles, les d-bloqueurs et les d-transversaux.Les d-extensibles de stables optimaux sont des ensembles de sommets d'un graphe G tels que tout stable de cardinal d du sous-graphe induit par un d-extensible peut être étendu à un stable optimal de G à l'aide de sommets qui n'appartiennent pas au d-extensible. Nous étudions les d-extensibles de cardinal maximal de stables dans les graphes bipartis. Nous démontrons quelques propriétés structurelles puis nous déterminons une borne inférieure du cardinal maximal d'un d-extensible. Nous étudions quelques classes de graphes dans lesquelles déterminer un d-extensible optimal de stables est un problème polynomial. Nous nous intéressons ensuite aux d-extensibles de stables dans les arbres. Nous prouvons plusieurs propriétés structurelles, déterminons une autre borne inférieure du cardinal maximal d'un d-extensible et étudions quelques classes d'arbres dans lesquelles déterminer un d-extensible optimal de stables est un problème polynomial.Les d-bloqueurs de stables sont des ensembles de sommets d'un graphe G tels que, si on retire les sommets d'un d-bloqueur, le cardinal maximal d'un stable du graphe induit par les sommets restants est inférieur d'au moins d au cardinal maximal d'un stable du graphe initial. Nous nous intéressons ici aux d-bloqueurs de coût minimal de stables dans les arbres. Après avoir prouvé une caractérisation des d-bloqueurs de stables dans les arbres, nous démontrons que déterminer un d-bloqueur de coût minimal de stable est un problème polynomial dans une classe d'arbres particulière.Soit Pi un problème d'optimisation sur un ensemble d'éléments fini. Un d-transversal de Pi est un ensembles d'éléments tel que l'intersection entre le d-transversal et toute solution optimale au problème Pi est de cardinal supérieur égal à d. Nous proposons ici une approche de génération de contraintes pour déterminer des d-transversaux de cardinal maximal de problèmes modélisés par des programmes mathématiques en variables binaires. Nous étudions deux variantes de cette approche que nous testons sur des instances de graphes générés aléatoirement pour déterminer des d-transversaux de stables optimaux et des d-transversaux de couplages optimaux / In this thesis, we study three types of problems : the d-extensibles sets, the d-blockers and the d-transversals.In a graph G, a d-extensible set of maximum independent sets is a subset of vertices of G such that every stable set of cardinality d in the subgraph restricted to the d-extensible set can be extented to a maximum stable set of G using only vertices that do not belong to the d-extensible set. We study d-extensible sets of mxaimum cardinality of stable sets in bipartite graphs. We show some structural properties and we determine a lower bound of the maximum cardinality of a d-extensible set. We consider some classes of graph where finding an optimum d-extensible set can be done in polynomial time. Then, we study the d-extensibles sets of stable sets in trees. We prove some properties on the structures of the d-extensibles sets and we determine another lower bound of the maximum cardinality of a d-extensible set. Finaly, we study somme classes of tree where a d-extensible sets of maximum cardinality can be done in polynomial time.In a graph G, a d-blocker is a subset of vertices such that, if removed, a maximum stable set of the resulting subgraph is of cardinality at most the cardinality of a maximum stable set of G minus d. We study d-blocker of minimal cost of stable sets in tree.We prove a caracterisation of d-blockers in tree and we study a particular classe of trees where computing a d-blocker of minimal cost of stable sets can be done in polynomial time.Let Pi be an optimisation problem on a finite set of elements. A d-transversal of Pi is a subset of elements such that the intersection between the d-transversal and every optimal solution of Pi contains at lest d elements. We propose an approach to compute d-transversal of any optimisation problem modelised by mathematical program with binary variables. We use a contraints generation approach. We compare two variations of this approach on randomly generated graph by computing d-transversals of stables sets and d-transversals of matching

ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / The focus of this paper is to describe a unified methodology for developing both internal and external data display translators between an Instrumentation Support System (ISS) format and Data Display Markup Language (DDML), a neutral language for describing data displays. The methodology includes aspects common to both ISSs that have a well documented text-based save format and those that do not, as well as aspects that are unique to each type. We will also describe the means by which an external translator can be integrated into a translator framework. Finally, we will describe how an internal translator can be integrated directly into the ISS.

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / The Instrumentation Hardware Abstraction Language (IHAL) has been developed to be a neutral language that is focused on the description and control of instrumentation systems and networks. This paper describes the various instrumentation configuration management tools we have designed that make use of IHAL’s neutral specification of instrumentation networks. We discuss the features currently present in prototypes as well as future enhancements.