Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogu... more Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogues when executed by a quantum computer. As quantum computers are currently unavailable for general use, one approach for analyzing the behavior and re- sults of such algorithms is the simulation using classical computers. As this simulation is inefficient due to the exponential growth of the temporal and spatial complexities, solutions for these two problems are essential in order to increase the simulation capa- bilities of any simulator. This work proposes the development of a methodology defined by two main steps: the first consists of the sequential implementation of the abstractions corresponding to the Quantum Processes and Quantum Partial Processes defined in the qGM model for reduction in memory consumption related to multidimensional quantum transformations; the second is the parallel implementation of such abstractions allowing its execution on GPUs. The results obtained by thi...
Proceedings. First Latin American Web Congress, 2003
The heterogeneity and the highly dynamic behavior of the grid computing demands a new class of sc... more The heterogeneity and the highly dynamic behavior of the grid computing demands a new class of scheduling strategies. These strategies must not only consider the instantaneous information provided by sensors, but also probabilities of the information received to keep its values in a near future.
2013 2nd Workshop-School on Theoretical Computer Science, 2013
ABSTRACT The main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy... more ABSTRACT The main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy s-(N)Xor, which is explicitly defined and graphically represented by the product t-norm, probabilistic sum and standard negation. The fuzzy s-Xor (co)implications obtained by such fuzzy s-X(N)or connectives are also considered along with the corresponding conjugate functions. The relationship between a fuzzy s-Xor E and its conjugate function Eρ is discussed in the following together with their dual constructions. Additionally, for a fuzzy s-Xor E connective both constructions, its dual connective XNor EN and its conjugate Eρ, satisfy analogous properties of the e-Xor class.
Abstract The main contribution of this work is the development of a distributed memory architectu... more Abstract The main contribution of this work is the development of a distributed memory architecture for the Distributed Geometric Machine Environment (D-GM) by using a distributed shared memory software implementation (DSM) named ShareD-GM. This work ...
This article proposes a model for resource discovery di-rected to ubiquitous computing with techn... more This article proposes a model for resource discovery di-rected to ubiquitous computing with technologies for se-mantic processing aggregated to its architecture. The EXEHDA-SD contributes to increase the expressiveness of the representation and consultation for resources in a ...
We consider that the concept derived of the integration of pervasive, context-aware and grid comp... more We consider that the concept derived of the integration of pervasive, context-aware and grid computing is suitable for building the next generation of the grid applications which assist to nomadic and mobile users. To demonstrate our ideas we have implemented a pilot ...
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012
ABSTRACT The simulation of quantum algorithms in classic computers is a task which requires high ... more ABSTRACT The simulation of quantum algorithms in classic computers is a task which requires high processing and storing capabilities, limiting the size of quantum systems supported by the simulators. However, optimizations for reduction of temporal and spatial complexities are promising, expanding the capabilities of some simulators. The main contribution of this work consists in designing optimizations resulting from the description of quantum transformations using Quantum Processes and Partial Quantum Processes conceived in the qGM theoretical model. These processes, when computed on the VPE-qGM execution environment, require low execution time and result in the improvement of the performance, allowing the simulation of more complex quantum algorithms. The performance evaluation of this proposal was performed by benchmarks used in similar works and included the sequential simulation of quantum algorithms up to 24 qubits. The results are promising when compared to the state-of-art, indicating the possibilities of advances in this research.
Proceedings of the 29th Annual ACM Symposium on Applied Computing, 2014
ABSTRACT The simulation of algorithms from quantum computing is currently the most affordable sol... more ABSTRACT The simulation of algorithms from quantum computing is currently the most affordable solution for development of new applications. Due to the high computational cost of such simulation, solutions towards novel features that in-crease the performance are always desired. This work pro-poses an extension for the D-GM's simulation framework, establishing the support for GPU-aware distributed quan-tum simulation. The project explores the concepts of het-erogeneous computing, merging distributed and GPU com-puting in a single programming environment. Our results comprehend the distributed simulation of systems comprised by Hadamard transformations up to 21 qubits. Detailed analysis and a performance comparison between PyCUDA and JCUDA frameworks for our application are discussed. This work is a significant step towards the ultimate goal of our project, which is the hybrid simulation of quantum algorithms, i.e., exploring multi-core CPUs and GPUs dis-tributed along a cluster, achieving scalability when larger systems are simulated.
Anais do XIV Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2013), 2013
Um dos principais desafios de pesquisa da Computação Ubíqua (UbiComp) diz respeito a necessidade d... more Um dos principais desafios de pesquisa da Computação Ubíqua (UbiComp) diz respeito a necessidade das aplicações terem consciência do contexto situacional e, quando apropriado, responder de forma proativa a mudanças no mesmo. Este artigo apresenta uma arquitetura para consciência de situação, denominada EXEHDA-SA (Execution Environment for Highly Distributed Applications-Situation Awareness). Considera-se como principal contribuição deste trabalho a concepção de uma arquitetura para aquisição, processamento e disseminação de informações contextuais, de forma distribuída, independente das aplicações, em uma perspectiva autonômica e baseada em regras. Para avaliar as funcionalidades do EXEHDA-SA é apresentado um estudo de caso que destaca a prototipação e testes realizados.
Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogu... more Quantum computing proposes quantum algorithms exponentially faster than their clas- sical analogues when executed by a quantum computer. As quantum computers are currently unavailable for general use, one approach for analyzing the behavior and re- sults of such algorithms is the simulation using classical computers. As this simulation is inefficient due to the exponential growth of the temporal and spatial complexities, solutions for these two problems are essential in order to increase the simulation capa- bilities of any simulator. This work proposes the development of a methodology defined by two main steps: the first consists of the sequential implementation of the abstractions corresponding to the Quantum Processes and Quantum Partial Processes defined in the qGM model for reduction in memory consumption related to multidimensional quantum transformations; the second is the parallel implementation of such abstractions allowing its execution on GPUs. The results obtained by thi...
Proceedings. First Latin American Web Congress, 2003
The heterogeneity and the highly dynamic behavior of the grid computing demands a new class of sc... more The heterogeneity and the highly dynamic behavior of the grid computing demands a new class of scheduling strategies. These strategies must not only consider the instantaneous information provided by sensors, but also probabilities of the information received to keep its values in a near future.
2013 2nd Workshop-School on Theoretical Computer Science, 2013
ABSTRACT The main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy... more ABSTRACT The main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy s-(N)Xor, which is explicitly defined and graphically represented by the product t-norm, probabilistic sum and standard negation. The fuzzy s-Xor (co)implications obtained by such fuzzy s-X(N)or connectives are also considered along with the corresponding conjugate functions. The relationship between a fuzzy s-Xor E and its conjugate function Eρ is discussed in the following together with their dual constructions. Additionally, for a fuzzy s-Xor E connective both constructions, its dual connective XNor EN and its conjugate Eρ, satisfy analogous properties of the e-Xor class.
Abstract The main contribution of this work is the development of a distributed memory architectu... more Abstract The main contribution of this work is the development of a distributed memory architecture for the Distributed Geometric Machine Environment (D-GM) by using a distributed shared memory software implementation (DSM) named ShareD-GM. This work ...
This article proposes a model for resource discovery di-rected to ubiquitous computing with techn... more This article proposes a model for resource discovery di-rected to ubiquitous computing with technologies for se-mantic processing aggregated to its architecture. The EXEHDA-SD contributes to increase the expressiveness of the representation and consultation for resources in a ...
We consider that the concept derived of the integration of pervasive, context-aware and grid comp... more We consider that the concept derived of the integration of pervasive, context-aware and grid computing is suitable for building the next generation of the grid applications which assist to nomadic and mobile users. To demonstrate our ideas we have implemented a pilot ...
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012
ABSTRACT The simulation of quantum algorithms in classic computers is a task which requires high ... more ABSTRACT The simulation of quantum algorithms in classic computers is a task which requires high processing and storing capabilities, limiting the size of quantum systems supported by the simulators. However, optimizations for reduction of temporal and spatial complexities are promising, expanding the capabilities of some simulators. The main contribution of this work consists in designing optimizations resulting from the description of quantum transformations using Quantum Processes and Partial Quantum Processes conceived in the qGM theoretical model. These processes, when computed on the VPE-qGM execution environment, require low execution time and result in the improvement of the performance, allowing the simulation of more complex quantum algorithms. The performance evaluation of this proposal was performed by benchmarks used in similar works and included the sequential simulation of quantum algorithms up to 24 qubits. The results are promising when compared to the state-of-art, indicating the possibilities of advances in this research.
Proceedings of the 29th Annual ACM Symposium on Applied Computing, 2014
ABSTRACT The simulation of algorithms from quantum computing is currently the most affordable sol... more ABSTRACT The simulation of algorithms from quantum computing is currently the most affordable solution for development of new applications. Due to the high computational cost of such simulation, solutions towards novel features that in-crease the performance are always desired. This work pro-poses an extension for the D-GM's simulation framework, establishing the support for GPU-aware distributed quan-tum simulation. The project explores the concepts of het-erogeneous computing, merging distributed and GPU com-puting in a single programming environment. Our results comprehend the distributed simulation of systems comprised by Hadamard transformations up to 21 qubits. Detailed analysis and a performance comparison between PyCUDA and JCUDA frameworks for our application are discussed. This work is a significant step towards the ultimate goal of our project, which is the hybrid simulation of quantum algorithms, i.e., exploring multi-core CPUs and GPUs dis-tributed along a cluster, achieving scalability when larger systems are simulated.
Anais do XIV Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2013), 2013
Um dos principais desafios de pesquisa da Computação Ubíqua (UbiComp) diz respeito a necessidade d... more Um dos principais desafios de pesquisa da Computação Ubíqua (UbiComp) diz respeito a necessidade das aplicações terem consciência do contexto situacional e, quando apropriado, responder de forma proativa a mudanças no mesmo. Este artigo apresenta uma arquitetura para consciência de situação, denominada EXEHDA-SA (Execution Environment for Highly Distributed Applications-Situation Awareness). Considera-se como principal contribuição deste trabalho a concepção de uma arquitetura para aquisição, processamento e disseminação de informações contextuais, de forma distribuída, independente das aplicações, em uma perspectiva autonômica e baseada em regras. Para avaliar as funcionalidades do EXEHDA-SA é apresentado um estudo de caso que destaca a prototipação e testes realizados.
Uploads
Papers