Marion G. Harmon

955 total citations
16 papers, 619 citations indexed

About

Marion G. Harmon is a scholar working on Hardware and Architecture, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Marion G. Harmon has authored 16 papers receiving a total of 619 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Hardware and Architecture, 3 papers in Computational Theory and Mathematics and 2 papers in Computer Networks and Communications. Recurrent topics in Marion G. Harmon's work include Real-Time Systems Scheduling (15 papers), Parallel Computing and Optimization Techniques (13 papers) and Embedded Systems Design Techniques (13 papers). Marion G. Harmon is often cited by papers focused on Real-Time Systems Scheduling (15 papers), Parallel Computing and Optimization Techniques (13 papers) and Embedded Systems Design Techniques (13 papers). Marion G. Harmon collaborates with scholars based in United States and Germany. Marion G. Harmon's co-authors include David Whalley, Christopher Healy, Robert D. Arnold, Frank Mueller, Frank Mueller, T. P. Baker and Chris Healy and has published in prestigious journals such as IEEE Transactions on Computers, ACM SIGPLAN Notices and Software Practice and Experience.

In The Last Decade

Marion G. Harmon

16 papers receiving 542 citations

Peers

Countries citing papers authored by Marion G. Harmon

Since Specialization

Citations

This map shows the geographic impact of Marion G. Harmon's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marion G. Harmon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marion G. Harmon more than expected).

Fields of papers citing papers by Marion G. Harmon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marion G. Harmon. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marion G. Harmon. The network helps show where Marion G. Harmon may publish in the future.

Co-authorship network of co-authors of Marion G. Harmon

This figure shows the co-authorship network connecting the top 25 collaborators of Marion G. Harmon. A scholar is included among the top collaborators of Marion G. Harmon based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Marion G. Harmon. Marion G. Harmon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

#	Work	Indexed citations
1	A retargetable technique for predicting execution time 2003 ·Marion G. Harmon, T. P. Baker, David Whalley	18
2	Predictability of program execution times on superscalar pipelined architectures 2002 ·(unknown), Marion G. Harmon	3
3	Integrating the timing analysis of pipelining and instruction caching 2002 ·Christopher Healy, David Whalley, Marion G. Harmon	96
4	Supporting the specification and analysis of timing constraints 2002 ·(unknown), Christopher Healy, (unknown), Robert D. Arnold, David Whalley, Marion G. Harmon	11
5	Timing analysis for data caches and set-associative caches 2002 ·(unknown), Frank Mueller, Christopher Healy, David Whalley, Marion G. Harmon	90
6	Timing constraint specification and analysis 1999 ·Software Practice and Experience ·(unknown), (unknown), Christopher Healy, (unknown), Robert D. Arnold, David Whalley, Marion G. Harmon	4
7	Timing Analysis for Data and Wrap-Around Fill Caches 1999 ·Real-Time Systems ·(unknown), Frank Mueller, Chris Healy, David Whalley, Marion G. Harmon	42
8	Timing constraint specification and analysis 1999 ·Software Practice and Experience ·(unknown), (unknown), Christopher Healy, (unknown), Robert D. Arnold, David Whalley, Marion G. Harmon	10
9	Bounding pipeline and instruction cache performance 1999 ·IEEE Transactions on Computers ·Christopher Healy, Robert D. Arnold, Frank Mueller, David Whalley, Marion G. Harmon	151
10	Supporting user-friendly analysis of timing constraints 1995 ·ACM SIGPLAN Notices ·(unknown), David Whalley, Marion G. Harmon	12
11	Supporting user-friendly analysis of timing constraints 1995 ·ACM SIGPLAN Notices ·(unknown), David Whalley, Marion G. Harmon	7
12	* Bounding Worst-case Instruction Cache Performance 1994 ·Robert D. Arnold, Frank Mueller, David Whalley, Marion G. Harmon	140
13	A retargetable technique for predicting execution time of code segments 1994 ·Real-Time Systems ·Marion G. Harmon, T. P. Baker, David Whalley	28
14	Predicting execution time on contemporary computer architectures 1991 ·Marion G. Harmon	4
15	Predicting execution time of real-time programs on contemporary machines 1990 ·Marion G. Harmon	2
16	An Ada implementation of Marsaglia's universal random number generator 1988 ·ACM SIGAda Ada Letters ·Marion G. Harmon	1

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact