The coherence protocol is a first-order design concern in multicore designs. Directory protocols are naturally scalable, as they place no restrictions on the interconnect and have minimal bandwidth requirements; however, this scalability comes at the cost of increased sharing latency due to indirection. In contrast, broadcast-based systems such as snooping protocols and token coherence reduce l...

By run-time characteristic analysis of parallel workloads, we found that a majority of shared data accesses of parallel workload has temporal locality. Based on this characteristic, we present a sharing relation cache (SRC for short) based CMP architecture, saving recently used sharing relations to provide destination set information for following cache-to-cache miss requests. Token-SRC protoco...

A mutual distributed algorithm on a token ring is proposed in this paper. The proposed algorithm is based on the token ring approach and allows simultaneous existence of several tokens in the logical ring of the network. Each process generates a unique token and sends it as request to enter the critical section that travels along the ring. The process can only enter the critical section if it g...

A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...

Girard’s Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming languages. One way is to use abstract machines that pass a token in a fixed graph, along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on...

Many recent studies have demonstrated the influence of sublexical frequency measures on language processing, or called for controlling sublexical measures when selecting stimulus material for psycholinguistic studies (Aichert & Ziegler, 2005). The present study discusses which measures should be controlled for in what kind of study, and presents orthographic and phonological syllable, dual unit...

The problems of Permutation Routing via Matching and Token Swapping are reconfiguration problems on graphs. This paper is concerned with the complexity of those problems and a colored variant. For a given graph where each vertex has a unique token on it, those problems require to find a shortest way to modify a token placement into another by swapping tokens on adjacent vertices. While all pair...

In this paper, we describe systems for automatic labeling of time expressions occurring in English and Chinese text as specified in the ACE Temporal Expression Recognition and Normalization (TERN) task. We cast the chunking of text into time expressions as a tagging problem using a bracketed representation at token level, which takes into account embedded constructs. We adopted a left-to-right,...

The Token Passing MAC protocol for Ad Hoc networks (T-MAH), discussed in this paper, is a distributed medium access protocol designed for wireless multi-hop networks. With T-MAH access scheme the network is organized in clusters (called Token Groups) with a Token Group Head as the leader of the group. In each single cluster is used a token based technique, i.e. each node in the cluster is allow...

This paper presents the design and first experimental results of VTPE (Virtual Token-passing Ethernet). VTPE is a deterministic protocol for real-time applications based on shared Ethernet, aimed to be used either in small processing power processors or in powerful ones. It is based on implicit token rotation similar to the virtual token-passing used in the P-NET protocol. The VTPE implementati...