Not all applications have boring communication patterns: Profiling message matching with BMM

Taylor L. Groves, Naveen Ravichandrasekaran, Brandon Cook 0001, Noel Keen, David Trebotich, Nicholas J. Wright, Bob Alverson, Duncan Roweth, Keith D. Underwood. Not all applications have boring communication patterns: Profiling message matching with BMM. Concurrency - Practice and Experience, 35(15), 2023. [doi]

Authors

Taylor L. Groves

This author has not been identified. Look up 'Taylor L. Groves' in Google

Naveen Ravichandrasekaran

This author has not been identified. Look up 'Naveen Ravichandrasekaran' in Google

Brandon Cook 0001

This author has not been identified. Look up 'Brandon Cook 0001' in Google

Noel Keen

This author has not been identified. Look up 'Noel Keen' in Google

David Trebotich

This author has not been identified. Look up 'David Trebotich' in Google

Nicholas J. Wright

This author has not been identified. Look up 'Nicholas J. Wright' in Google

Bob Alverson

This author has not been identified. Look up 'Bob Alverson' in Google

Duncan Roweth

This author has not been identified. Look up 'Duncan Roweth' in Google

Keith D. Underwood

This author has not been identified. Look up 'Keith D. Underwood' in Google