Filters








72 Hits in 6.2 sec

Mixed-precision AMG as linear equation solver for definite systems

Maximilian Emans, Albert van der Meer
2010 Procedia Computer Science  
The data of basic linear algebra benchmarks are used to interpret the performance of AMG algorithms employed as linear solvers in computational fluid dynamics simulation tools.  ...  The algorithmic considerations comprise the effect of preconditioning in 4-byte floating point arithmetic on Krylov solvers using standard 8-byte floating point arithmetic.  ...  The benchmarks were run within the environment of the software AVL FIRE (R) 2009 with 1, 2, 4, 8, and 16 parallel processes, where the domain decomposition was performed once for each case by the standard  ... 
doi:10.1016/j.procs.2010.04.020 fatcat:o75zynhv2jf7thaowdzk3a743q

Steps towards GPU Accelerated Aggregation AMG

Maximilian Emans, Manfred Liebmann, Branislav Basara
2012 2012 11th International Symposium on Parallel and Distributed Computing  
We present an implementation of AMG with simple aggregation techniques on multiple GPUs. It supports the parallel matrix representations typically used for finite volume discretisation.  ...  We show that the solution phase of the standard v-cycle AMG with simple aggregation is accelerated by a factor of up to 12.  ...  the government of Upper Austria.  ... 
doi:10.1109/ispdc.2012.19 dblp:conf/ispdc/EmansLB12 fatcat:mz44zvfervfx3gow7ss7u3z5ly

A NOVEL SIMPLE-BASED PRESSURE-ENTHALPY COUPLING SCHEME FOR ENGINE FLOW PROBLEMS

Maximilian Emans, Zoran Žunič, Branislav Basara, Sergey Frolov
2012 Mathematical Modelling and Analysis  
Instead of solving the linear equations for each variable and the pressurecorrection equation separately in a so-called segregated manner, it relies on the solution of a linear system that comprises the  ...  We show that the novel method is a reasonable extension of existing CFD techniques for variable density flows based on SIMPLE.  ...  and by the government of Upper Austria.  ... 
doi:10.3846/13926292.2012.643504 fatcat:sum3oecfynggfdosr3ykkwncpa

Logical and Stochastic Modeling with Smart [chapter]

G. Ciardo, R. L. Jones, A. S. Miner, R. Siminiceanu
2003 Lecture Notes in Computer Science  
We describe the main features of S m A r T, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems.  ...  For the study of stochastic and timing behavior, both sparse-storage and Kronecker numerical solution approaches are available when the underlying process is a Markov chain.  ...  Since all firing time distributions are specified as expo, the underlying process is automatically recognized to be a CTMC.  ... 
doi:10.1007/978-3-540-45232-4_6 fatcat:2rlvkonr55ab7f67piphgi2k5q

Concurrency Control for Adaptive Indexing [article]

Goetz Graefe, Felix Halim, Stratos Idreos, Harumi Kuno, Stefan Manegold
2012 arXiv   pre-print
A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism  ...  The goal is to achieve the benefits of indexes while hiding or minimizing the costs of index creation.  ...  , and (2) a memory resident AVL tree that serves as a table-of-contents to keep track of the key ranges that have been requested so far.  ... 
arXiv:1203.6405v1 fatcat:36d44ujj6nfatmk6qdhgqa5qru

Concurrency control for adaptive indexing

Goetz Graefe, Felix Halim, Stratos Idreos, Harumi Kuno, Stefan Manegold
2012 Proceedings of the VLDB Endowment  
A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism  ...  The goal is to achieve the benefits of indexes while hiding or minimizing the costs of index creation.  ...  , and (2) a memory resident AVL tree that serves as a table-of-contents to keep track of the key ranges that have been requested so far.  ... 
doi:10.14778/2180912.2180918 fatcat:bnw2pruxubatthhlk3qnzxg4em

Logic and stochastic modeling with S m A r T

G. Ciardo, R.L. Jones, A.S. Miner, R.I. Siminiceanu
2006 Performance evaluation (Print)  
We describe the main features of S m A r T, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems.  ...  Finally, since S m A r T targets both the classroom and realistic industrial settings as a learning, research, and application tool, it is written in a modular way that allows for easy integration of new  ...  Memory usage for R, for the polling system with K = 4.  ... 
doi:10.1016/j.peva.2005.06.001 fatcat:sntffx5op5fjjklqhxgsimfrle

Holistic Indexing in Main-memory Column-stores

Eleni Petraki, Stratos Idreos, Stefan Manegold
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
In this paper, we present the design of holistic indexing for columnoriented database architectures and we discuss a detailed analysis against parallel versions of state-of-the-art indexing and adaptive  ...  When the system detects idle CPU cycles, it utilizes those extra cycles by refining the adaptive indices which are most likely to bring a benefit for future queries.  ...  Acknowledgments We would like to thank Victor Alvarez, Felix Martin Schuhknecht, Jens Dittrich and Stefan Richter for kindly providing the source code of the chunked coarse granular adaptive indexing algorithm  ... 
doi:10.1145/2723372.2723719 dblp:conf/sigmod/PetrakiIM15 fatcat:3u3vest7w5ccxfruhiayekiyq4

Future contracts

Christos Dimoulas, Riccardo Pucella, Matthias Felleisen
2009 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP '09  
We present both a model and a prototype implementation of our language design. Our model comprises a higher-order imperative language and we use it to prove the correctness of our design.  ...  Our implementation is robust enough to measure the performance of reasonably large benchmarks, demonstrating that the use of future contracts can lead to significant performance improvements.  ...  Our contract system distributes contract monitoring over both the master and the slave thread.  ... 
doi:10.1145/1599410.1599435 dblp:conf/ppdp/DimoulasPF09 fatcat:dm5l4lghwnecfcolnoawjf5hbi

Adaptive Voltage Scaling with In-Situ Detectors in Commercial FPGAs

Jose Luis Nunez-Yanez
2015 IEEE transactions on computers  
a more complex benchmark set that will not fit in the limited internal memories.  ...  A particular benchmark set (e.g.  ... 
doi:10.1109/tc.2014.2365963 fatcat:fpbjprqw3rgb3nkcj53zs37cy4

Integrated Mobile Laboratory for Air Pollution Assessment: Literature Review and cc-TrAIRer Design

Chiara Boanini, Domenico Mecca, Federica Pognant, Matteo Bo, Marina Clerico
2021 Atmosphere  
The integrated use of gas and particle analysers, a weather station and environment monitoring systems in a single easily transportable vehicle will contribute to research studies on global aspects of  ...  The preliminary results highlight the future applications of the trailer and the importance of high temporal resolution data acquisition for the characterization of pollution phenomena.  ...  We are also very grateful to Nuova Allcar for the supply in the execution of the trailer. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/atmos12081004 fatcat:xqf46momi5el7iezcduljtz4ya

Optimizing Compilation and Computational Complexity of Constraint Handling Rules [chapter]

Jon Sneyers
2009 Lecture Notes in Computer Science  
Originally designed in the early 1990s as a specialpurpose programming language for adding user-defined constraint solvers to a host language, CHR has evolved over the last decade into a powerful and elegant  ...  Computational complexity theory is the study of scalability of computer programs in terms of the computational resources they require -in particular, time (cpu usage) and space (memory usage).  ...  Benchmark 2 : 2 "MFib". In the second benchmark, "MFib", O(n) memory cells are used.  ... 
doi:10.1007/978-3-642-02846-5_41 fatcat:ywwhwcnysbea3alkxbrz7ppfxe

Looking back at Postgres [chapter]

Joseph M. Hellerstein
2018 Making Databases Work: the Pragmatic Wisdom of Michael Stonebraker  
This was a very ambitious aspect of the Postgres agenda: a software architecture problem affecting most of a database engine, from the optimizer to the storage layer and the logging and recovery system  ...  This allowed for an optimizer that maintained the textbook dynamic programming architecture of System R, with a small additional sorting cost to get the expensive selections ordered properly. 2 The expensive  ...  Acknowledgments I'm indebted to my old Postgres buddies Wei Hong, Jeff Meredith, and Mike Olson for their remembrances and input, and to Craig Kerstiens for his input on modernday PostgreSQL.  ... 
doi:10.1145/3226595.3226614 fatcat:qwsnpw3g7bd6tkyfudlu6jhxze

Intelligent Edge-Embedded Technologies for Digitising Industry [chapter]

Ovidiu Vermesan, Mario Diaz Nava
2022 Intelligent Edge-Embedded Technologies for Digitising Industry  
The "River Publishers Series in Communications and Networking" is a series of comprehensive academic and professional books which focus on communication and network systems.  ...  Topics range from the theory and use of systems involving all terminals, computers, and information processors to wired and wireless networks and network layouts, protocols, architectures, and implementations  ...  Acknowledgements This work is conducted under the framework of the ECSEL AI4DI "Artificial Intelligence for Digitising Industry" project.  ... 
doi:10.13052/rp-9788770226103 fatcat:mgz277pmkbetvbpoaomoktzgzi

Is Parallel Programming Hard, And, If So, What Can You Do About It? (Release v2021.12.22a) [article]

Paul E. McKenney
2021 arXiv   pre-print
The purpose of this book is to help you program shared-memory parallel systems without risking your sanity.  ...  This book is written in the hope that presenting the engineering discipline underlying successful parallel-programming projects will free a new generation of parallel hackers from the need to slowly and  ...  This is one of the differences between shared-memory and distributed-system parallelism: shared-memory parallel programs must normally deal with no obstacle worse than a cache miss, while a distributed  ... 
arXiv:1701.00854v4 fatcat:pxiajyczebd5pm76htwnrczhm4
« Previous Showing results 1 — 15 out of 72 results