A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.

Study on Granular Dynamics in Vertically Vibrated Beds using Tracking Technique

The study of granular material is of great interest to many researchers in both engineering and science communities. The importance of such a study derives from its complex rheological character and also its significant role in a wide range of industrial applications, such as coal, food, plastics, pharmaceutical, powder metallurgy and mineral processing. A number of recent reports have been focused on the physics of non-cohesive granular material submitted to vertical vibration in either experimental or theoretical approaches. Such a kind of system can be used to separate, mix and dry granular materials in industries. It exhibits different instability behaviour on its surface when under vertical vibration, for example, avalanching, surface fluidization and surface wave, and these phenomena have attracted particular interest of many researchers. However, its fundamental understanding of the instability mechanism is not yet well-understood. This paper is therefore to study the dynamics of granular motion in such a kind of system using Positron Emission Particle Tracking (PEPT), which allows the motion of a single tracer particle to be followed in a non-invasive way. Features of the solids motion such as cycle frequency and dispersion index were investigated via means of authors’ specially-written programmes. Regardless of the surface behaviour, particles are found to travel in rotational movement in horizontal plane. Particle cycle frequency is found to increase strongly with increasing vibration amplitude. Particle dispersion also increased strongly with vibration amplitude. Horizontal dispersion is observed to always exceed vertical dispersion.