Research Initiation Program - Classifying Shared Objects by their Synchronization Power

9410421 Jayanti这个项目的主要目标是获得一个分类的同步原语在并行处理系统中，与反映的权力和每个原语的限制的目标。并行处理系统解决计算的有效性在很大程度上取决于对进程间通信和同步的支持。在共享存储器系统中，诸如共享队列之类的更高级共享对象使用共享硬件原语（如寄存器和测试集指令）在软件中实现。在容错异步系统中，其中进程以任意变化的速率进行，这样的软件实现必须保证进程可以成功完成，而不管其他进程有多快或多慢。已知硬件原语在它们支持这样的软件实现的能力方面变化很大。在这项研究中提出的分类将带出同步原语的能力和局限性。分类将是有用的多处理器的设计者在决定哪些原语在硬件中支持。这对于系统程序员确定高级感兴趣对象（例如，可以由100个进程同时访问的队列）在给定系统中具有软件实现。 ***

9410421 Jayanti The main objective of this project is to obtain a classification of synchronization primitives in parallel processing systems, with the goal of reflecting the power and limitations of each primitive. The effectiveness of a parallel processing system to solve a computation depends to a large extent on the support for communication and synchronization among processes. In shared memory systems, higher level shared objects such as shared queues are implemented in software using shared hardware primitives like registers and test&set instructions. In fault- tolerant asynchronous systems, where processes progress at arbitrarily varying rates, such software implementations must guarantee that a process can complete successfully, regardless of how fast or slow the other processes are. It is known that hardware primitives vary widely in their ability to support such software implementations. The classification proposed in this research will bring out the capabilities and limitations of synchronization primitives. The classification will be useful to the designer of a multiprocessor in deciding which primitive to support in hardware. It will also be useful to the systems programmer in determining whether a high level object of interest (e.g., a queue that can be accessed concurrently by 100 processes) has a software implementation in a given system. ***