Search

Your search keyword '"Kolberg, Mariana"' showing total 102 results
Start Over Author "Kolberg, Mariana"
102 results on '"Kolberg, Mariana"'

12. Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures

Author

Milani, Cleber Roberto, Kolberg, Mariana, Fernandes, Luiz Gustavo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Palma, José M. Laginha M., editor, Daydé, Michel, editor, Marques, Osni, editor, and Lopes, João Correia, editor

Published
2011
Full Text
View/download PDF

13. The Impact of Data Distribution in Accuracy and Performance of Parallel Linear Algebra Subroutines

Author

Rocker, Björn, Kolberg, Mariana, Heuveline, Vincent, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Palma, José M. Laginha M., editor, Daydé, Michel, editor, Marques, Osni, editor, and Lopes, João Correia, editor

Published
2011
Full Text
View/download PDF

14. A Note on Solving Problem 7 of the SIAM 100-Digit Challenge Using C-XSC

Author

Kolberg, Mariana, Krämer, Walter, Zimmer, Michael, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Cuyt, Annie, editor, Krämer, Walter, editor, Luther, Wolfram, editor, and Markstein, Peter, editor

Published
2009
Full Text
View/download PDF

15. Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation

Author

Kolberg, Mariana, Bohlender, Gerd, Claudio, Dalcidio, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Palma, José M. Laginha M., editor, Amestoy, Patrick R., editor, Daydé, Michel, editor, Mattoso, Marta, editor, and Lopes, João Correia, editor

Published
2008
Full Text
View/download PDF

16. Optimizing a Parallel Self-verified Method for Solving Linear Systems

Author

Kolberg, Mariana, Baldo, Lucas, Velho, Pedro, Fernandes, Luiz Gustavo, Claudio, Dalcidio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kågström, Bo, editor, Elmroth, Erik, editor, Dongarra, Jack, editor, and Waśniewski, Jerzy, editor

Published
2007
Full Text
View/download PDF

17. Autonomous Environment Disinfection Based on Dynamic UV-C Irradiation Map

Author

Mantelli, Mathias, primary, Santos, Leticia dos, additional, de Fraga, Lucas, additional, Miotto, Giovanna, additional, Bergamin, Augusto, additional, Cardoso, Etevaldo, additional, Serrano, Miguel, additional, Maffei, Renan, additional, Prestes, Edson, additional, Netto, Joao, additional, and Kolberg, Mariana, additional

Published
2022
Full Text
View/download PDF

34. Using n-grams of spatial densities to construct maps

Author

Maffei, Renan, primary, Jorge, Vitor A. M., additional, Rey, Vitor F., additional, Franco, Guilherme S., additional, Giambastiani, Mariane, additional, Barbosa, Jessica, additional, Kolberg, Mariana, additional, and Prestes, Edson, additional

Published
2015
Full Text
View/download PDF

35. Exploring the IEEE ontology for robotics and automation for heterogeneous agent interaction

Author

Jorge, Vitor A.M., primary, Rey, Vitor F., additional, Maffei, Renan, additional, Fiorini, Sandro Rama, additional, Carbonera, Joel Luis, additional, Branchi, Flora, additional, Meireles, João P., additional, Franco, Guilherme S., additional, Farina, Flávia, additional, da Silva, Tatiana S., additional, Kolberg, Mariana, additional, Abel, Mara, additional, and Prestes, Edson, additional

Published
2015
Full Text
View/download PDF

38. Parallel self-verified solver for dense linear systems

Author

Kolberg, Mariana Luderitz, Claudio, Dalcidio Moraes, and CPF:00850080010

Subjects
ARITM?TICA COMPUTACIONAL, INFORM?TICA, CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO [CNPQ], PROCESSAMENTO PARALELO, SISTEMAS LINEARES
Abstract

Esta tese apresenta uma ferramenta de resolu??o de sistemas lineares densos pontuais e intervalares. As principais caracter?sticas desta ferramenta s?o rapidez, confiabilidade e precis?o. Esta ferramenta ? baseada em um m?todo de resolu??o de sistemas densos verificado usando arredondamentos direcionados e aritm?tica intervalar associados a bibliotecas otimizadas e primitivas MPI para prover resultados confi?veis e alto desempenho. A primeira vers?o paralela foi desenvolvida usando a biblioteca C-XSC. Esta vers?o n?o alcan?ou o desempenho global esperado uma vez que n?o foi paralelizada totalmente devido a particularidades do C-XSC (vari?veis especiais e produto escalar ?timo). Como o C-XSC n?o se mostrou eficiente para aplica??es de grande porte, foi proposta e implementada uma nova vers?o seq?encial para sistemas lineares densos usando tanto a aritm?tica de ?nfimo e supremo como a aritm?tica de ponto m?dio e raio, baseada nas bibliotecas BLAS e LAPACK. Testes de desempenho mostraram que o algoritmo que implementa a aritm?tica de ponto m?dio e raio possui um desempenho melhor do que o algoritmo que implementa a aritm?tica de ?nfimo e supremo. Considerando este resultado, a aritm?tica de ponto m?dio e raio foi escolhida para a pr?xima etapa: a implementa??o paralela. Uma vers?o paralela para solu??o de sistemas lineares pontuais e intervalares densos foi ent?o desenvolvida utilizando a aritm?tica de ponto m?dio e raio, arredondamentos direcionados e as bibliotecas otimizadas PBLAS e ScaLAPACK. Os resultados mostraram que foi poss?vel alcan?ar um bom desempenho utilizando um n?mero de processadores variado e proporcionando consider?vel acelera??o na obten??o dos resultados para diferentes tamanhos de matrizes (pontuais e intervalares). A fim de superar as limita??es impostas pelo uso da mem?ria na gera??o de toda a matriz em um s? processador, uma nova vers?o foi implementada. Esta vers?o gera as sub-matrizes da matriz principal em cada processador, permitindo uma melhor utiliza??o da mem?ria global disponibilizada pelo Cluster. Estas altera??es tornaram poss?vel resolver sistemas densos de dimens?o 100 000. Para investigar a portabilidade da solu??o proposta, os testes foram realizados em 3 Clusters diferentes na Alemanha (ALiCEnext, XC1 e IC1). Cada um destes Clusters possui configura??es distintas e apresentaram resultados significativos, indicando que a vers?o paralela possui uma boa escalabilidade para sistemas lineares muito grandes usando um n?mero variado de processadores. Outros estudos foram realizados em duas dire??es. O primeiro diz respeito ao uso de threads dedicadas para aumentar o desempenho da solu??o de sistemas lineares usando mem?ria compartilhada (em especial para processadores dual-core). Tamb?m foi estudada a utiliza??o dessas id?ias para aumentar o desempenho da solu??o usando C-XSC.

Published
2009

39. A Multithreaded Verified Method for Solving Linear Systems in Dual-Core Processors

Author

Kolberg, Mariana, Cordeiro, Daniel, Bohlender, Gerd, Fernandes, Luiz~gustavo, Goldman, Alfredo, Pontifícia Universidade Católica do Rio Grande do Sul [Porto Alegre] (PUCRS), PrograMming and scheduling design fOr Applications in Interactive Simulation (MOAIS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Karlsruhe Institute of Technology (KIT), Departamento de Ciência da Computação [São Paulo] (IME/USP), Universidade de São Paulo (USP), Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Pontifical Catholic University of Rio Grande do Sul (PUC-RS), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Universidade de São Paulo = University of São Paulo (USP)

Subjects
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

International audience; This paper presents a new multithreaded approach for the problem of solving dense linear systems with verified results. We propose a new method that allows our algorithm to run in a dual-core system without making any changes in the floating-point rounding mode used during the computations, i.e., each processor independently uses its own floating-point rounding strategy to do the computations. The algorithm distributes the computational tasks among the processors based on the floating-point rounding mode required by the task. We validate our approach experimentally.

Published
2008

40. A Note on Solving Problem 7 of the SIAM 100-Digit Challenge Using C-XSC

Author

Kolberg, Mariana, Kr��mer, Walter, and Zimmer, Michael

Subjects
high performance computing, C-XSC, reliable linear system solver, 100-digit challenge, reliable computing, large dense linear systems
Abstract

C-XSC is a powerful C++ class library which simplifies the development of selfverifying numerical software. But C-XSC is not only a development tool, it also provides a lot of predefined highly accurate routines to compute reliable bounds for the solution to standard numerical problems. In this note we discuss the usage of a reliable linear system solver to compute the solution of problem 7 of the SIAM 100-digit challenge. To get the result we have to solve a 20 000 ������������ 20 000 system of linear equations using interval computations. To perform this task we run our software on the advanced Linux cluster engine ALiCEnext located at the University of Wuppertal and on the high performance computer HP XC6000 at the computing center of the University of Karlsruhe. The main purpose of this note is to demonstrate the power/weakness of our approach to solve linear interval systems with a large dense system matrix using C-XSC and to get feedback from other research groups all over the world concerned with the topic described. We are very much interested to see comparisons concerning different methods/algorithms, timings, memory consumptions, and different hardware/software environments. It should be easy to adapt our main routine (see Section 3 below) to other programming languages, and different computing environments. Changing just one variable allows the generation of arbitrary large system matrices making it easy to do sound (reproducible and comparable) timings and to check for the largest possible system size that can be handled successfully by a specific package/environment.

Published
2008
Full Text
View/download PDF

42. JAR tool

Author

Kolberg, Mariana, primary, Fernandes, Luiz Gustavo, additional, Raeder, Mateus, additional, and Fonseca, Carolina, additional

Published
2014
Full Text
View/download PDF

46. A Note on Solving Problem 7 of the SIAM 100-Digit Challenge Using C-XSC

Author

Mariana Kolberg and Walter Krämer and Michael Zimmer, Kolberg, Mariana, Krämer, Walter, Zimmer, Michael, Mariana Kolberg and Walter Krämer and Michael Zimmer, Kolberg, Mariana, Krämer, Walter, and Zimmer, Michael

Abstract

C-XSC is a powerful C++ class library which simplifies the development of selfverifying numerical software. But C-XSC is not only a development tool, it also provides a lot of predefined highly accurate routines to compute reliable bounds for the solution to standard numerical problems. In this note we discuss the usage of a reliable linear system solver to compute the solution of problem 7 of the SIAM 100-digit challenge. To get the result we have to solve a 20 000 × 20 000 system of linear equations using interval computations. To perform this task we run our software on the advanced Linux cluster engine ALiCEnext located at the University of Wuppertal and on the high performance computer HP XC6000 at the computing center of the University of Karlsruhe. The main purpose of this note is to demonstrate the power/weakness of our approach to solve linear interval systems with a large dense system matrix using C-XSC and to get feedback from other research groups all over the world concerned with the topic described. We are very much interested to see comparisons concerning different methods/algorithms, timings, memory consumptions, and different hardware/software environments. It should be easy to adapt our main routine (see Section 3 below) to other programming languages, and different computing environments. Changing just one variable allows the generation of arbitrary large system matrices making it easy to do sound (reproducible and comparable) timings and to check for the largest possible system size that can be handled successfully by a specific package/environment.

Published
2008
Full Text
View/download PDF

47. Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation

Author

Mariana Kolberg and Gerd Bohlender and Dalcidio Claudio, Kolberg, Mariana, Bohlender, Gerd, Claudio, Dalcidio, Mariana Kolberg and Gerd Bohlender and Dalcidio Claudio, Kolberg, Mariana, Bohlender, Gerd, and Claudio, Dalcidio

Abstract

A parallel version of the self-verified method for solving linear systems was presented on PARA and VECPAR conferences in 2006. In this research we propose improvements aiming at a better performance. The idea is to implement an algorithm that uses technologies as MPI communication primitives associated to libraries as LAPACK, BLAS and C-XSC, aiming to provide both self-verification and speed-up at the same time. The algorithms should find an enclosure even for very ill-conditioned problems. In this scenario, a parallel version of a self-verified solver for dense linear systems appears to be essential in order to solve bigger problems. Moreover, the major goal of this research is to provide a free, fast, reliable and accurate solver for dense linear systems.

Published
2008
Full Text
View/download PDF

48. Segmented DP-SLAM

Author

Maffei, Renan, primary, Jorge, Vitor, additional, Kolberg, Mariana, additional, and Prestes, Edson, additional

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results