Analysis of the execution time unpredictability caused by dynamic branch prediction

J Engblom - The 9th IEEE Real-Time and Embedded …, 2003 - ieeexplore.ieee.org
This paper investigates how dynamic branch prediction in a microprocessor affects the
predictability of execution time for software running on that processor. By means of …

[PDF][PDF] Graphtea: Interactive graph self-teaching tool

MA Rostami, A Azadi, M Seydi - Proc. 2014 Int. Conf. Edu. & Educat …, 2014 - inase.org
It is becoming increasingly difficult to ignore the importance of graph theory and it's
application in various scientific areas. There is an urgent need for new tools to investigate …

Interactively exploring the connection between nested dissection orderings for parallel Cholesky factorization and vertex separators

HM Bücker, MA Rostami - 2014 IEEE International Parallel & …, 2014 - ieeexplore.ieee.org
Parallel computing is increasingly becoming a core component of undergraduate computing
curricula. It is not only part of degree programs in computer science or computer engineering …

An educational module illustrating how sparse matrix-vector multiplication on parallel processors connects to graph partitioning

MA Rostami, HM Bücker - Euro-Par 2015: Parallel Processing Workshops …, 2015 - Springer
The transition from a curriculum without parallelism topics to a re-designed curriculum that
incorporates such issues can be a daunting and time-consuming process. Therefore, it is …

Interactively exploring the connection between bidirectional compression and star bicoloring

MA Rostami, HM Bücker - Procedia Computer Science, 2015 - Elsevier
The connection between scientific computing and graph theory is detailed for a problem
called bidirectional compression. This problem consists of finding a pair of seed matrices in …

Enabling implicit time integration for compressible flows by partial coloring: a case study of a semi-matrix-free preconditioning technique

HM Bücker, M Lülfesmann, MA Rostami - … of the Seventh SIAM Workshop on …, 2016 - SIAM
Numerical techniques involving linearizations of nonlinear functions require the repeated
solution of systems of linear equations whose coefficient matrix is the Jacobian of that …

Redesigning interactive educational modules for combinatorial scientific computing

MA Rostami, HM Bücker - … ICCS 2019: 19th International Conference, Faro …, 2019 - Springer
Combinatorial scientific computing refers to the field of using combinatorial algorithms to
solve problems in computational science and data science. Teaching even elementary …

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

AN Shukla, V Bharti, ML Garg - EAI Endorsed Transactions on …, 2021 - publications.eai.eu
Graph colouring problem is a well-known NP-class optimization problem, studied due to a
lot of applications in various real-world problems. Some of these applications are: register …

[PDF][PDF] Interactive Educational Modules Illustrating Sparse Matrix Computations and their Corresponding Graph Problems.

MA Rostami, HM Bücker - Informatiktage, 2014 - dl.gi.de
Applications of graph theory are ubiquitous in many different scientific areas. Therefore
various software tools are available that aim at explaining graph concepts and graph …

[PDF][PDF] Graph tea: Simulating tool for graph theory & algorithms

BBR Emani, SS Maddipati, RK Rao - International Journal for Modern …, 2016 - academia.edu
Simulation in teaching has recently entered the field of education. It is used at different levels
of instruction. The teacher is trained practically and also imparted theoretical learning. In …