No abstract

From 1996 to 2000, he was a Hardware Design Engineer with Compaq, where he specialized in board layout for high-availability redundant array of independent disks (RAID) controllers. His current research interests include robotics, real-time control-system implementation, rapid prototyping for real-time systems, and modeling and analysis of mechatronic systems

Program activity graphs can be constructed from timestamped traces of appropriate execution events. tnfonnation about the activities on the k longest execution paths is useful in the analysis of parallel program perjiormance. In this papec four algorithms for finding the near-critical paths of program activity graphs are presented and compared, including an eflcient new algorithm that utilizes slack values calculated by the critical path method to perform a best-first search in linear space. The worst-case time and memory requirements of the new algorithm are in O(ke) and O(k+e), where e is the number of edges in the graph. Results confirming the eflciency of the algorithm are presented for five application programs. A framework for utilizing the near-critical path information is also described. The framework includes both statistical summaries and visualization capabilities.

No abstract

Dr. Mohammadi-Aragh investigates the formation of engineers during their undergraduate degree program, and the use of computing to measure and support that formation. She earned her Ph.D. in Engineering Education from Virginia Tech. In 2013, Dr. Mohammadi-Aragh was honored as a promising new engineering education researcher when she was selected as an ASEE Educational Research and Methods Division Apprentice Faculty.