Skip to search formSkip to main contentSkip to account menu

Active message

Known as: Active messages 
An Active message (in computing) is a messaging object capable of performing processing on its own. It is a lightweight messaging protocol used to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Computer performanceData parallelismMessage passingSPMD

Broader (1)

Inter-process communication

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Message Dissemination in Intermittently Connected D2D Communication Networks
Device-to-device (D2D) communications enable direct communications and information distribution among closely located devices in… 
2014
2014
Designing a High Performance OpenSHMEM Implementation Using Universal Common Communication Substrate as a Communication Middleware
OpenSHMEM is an effort to standardize the well-known SHMEM parallel programming library. The project aims to produce an open… 
2011
2011
A context-aware reflective middleware framework for distributed real-time and embedded systems
2009
2009
An Integral Approach to Programming Sensor Networks
In this paper we present a complete approach to programming sensor networks. The main contribution concerns the separation of… 
2009
2009
Asynchronous Programming in UPC: A Case Study and Potential for Improvement
In a traditional Partitioned Global Address Space language like UPC, an application programmer works with the model of a static… 
2003
2003
PIM Lite: On the Road Towards Relentless Multi-threading in Massively Parallel Systems
Processing In Memory (PIM) technology (mixing signiflcant processing logic with dense memory on the same chip) has become a… 
2000
2000
BSP clusters: High performance, reliable and very low cost
1999
1999
Wire-area parallel computing in Java
Java’s support for parallel and distributed processing makes the lan-guage attractive for metacomputing applications, such as… 
Highly Cited
1996
Highly Cited
1996
Parallel implementation of Bouvka's minimum spanning tree algorithm
We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of O. Boruvka (1926). The… 
1995
1995
Fast and Portable Parallel Architecture Simulators: Wisconsin Wind Tunnel II
Analysis of future parallel computers requires rapid simulation of target designs running realistic workloads. These simulations… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)