Sciweavers

548 search results - page 24 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
IWOMP
2009
Springer
15 years 6 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
98
Voted
ISORC
2008
IEEE
15 years 8 months ago
Structural Model of Real-Time Databases: An Illustration
A real-time database is a database in which both the data and the operations upon the data may have timing constraints. The design of this kind of database requires the introducti...
Nizar Idoudi, Claude Duvallet, Bruno Sadeg, Rafik ...
HPCN
1995
Springer
15 years 5 months ago
Exploiting high performance Fortran for computational fluid dynamics
Abstract. We discuss the High Performance Fortran data parallel programming language as an aid to software engineering and as a tool for exploiting High Performance Computing syste...
Kenneth A. Hawick, Geoffrey Fox
VEE
2010
ACM
238views Virtualization» more  VEE 2010»
15 years 7 months ago
Optimizing crash dump in virtualized environments
Crash dump, or core dump is the typical way to save memory image on system crash for future offline debugging and analysis. However, for typical server machines with likely abund...
Yijian Huang, Haibo Chen, Binyu Zang
196
Voted
POPL
2007
ACM
16 years 2 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi