This paper describes the usage patterns of the ThreadedComposite actor in Ptolemy II. This actor enables the execution of opaque actors (atomic actors or composite actors with directors) in a separate thread, thus providing multithreading for models of computation that are not already multthreaded. It can be used to execute an actor in the background, to execute multiple actors in parallel (e.g...

Bandwidth-starved multicore chips have become ubiquitous. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach that makes explicit use of shared caches in multicore environments and minimizes synchronization and boundary overhead. Benchmark results are presented for thre...

We explore a novel programming model for multicore architectures in which shared data-structures are replicated per-thread. With a suitable mechanism for broadcasting data-structure operations (which may be wait-free or lock-free) there is no longer a need for elaborate, datastructure-specific synchronization (e.g. as seen in java.util.concurrent) at each replica. Moreover, threads can lazily a...

1. introduction the effect of blocking on iran’s precipitation in numeral way and long-term has not been done yet. however, in some researches based on weak indexes like one-dimension has been implied to iran that in studying many cases we observe lack of blocking event and or their continuation that has been for less than 5 days. this phenomenon in some cases occurs in our country directly and...

iran is a rather wide country, and, as a rule, the chrage per one call in s. t .d . (subscriber trunk dialing ) is required more compared with a local call , so, just after the opening of the std service widely in national telephone network, unconcerned use of the s. t. d. service has been caused on an incon- ceivable increase in telephone charge of th subscriber. this is a common problem for a...

Many scientiic applications handle compressed sparse matrices. Cache behavior during the execution of codes with irregular access patterns, such as those generated by this type of matrices, has not been widely studied. In this work a probabilistic model for the prediction of the number of misses on a direct mapped cache memory considering sparse matrices with an uniform distribution is presente...

How can we capture the hidden properties from a tensor and a matrix data simultaneously? Coupled matrix-tensor factorization (CMTF) is an e‚ective method to solve this problem because it extracts latent factors from a tensor and matrices at once. Designing an ecient CMTF has become more crucial as the size and dimension of real-world data are growing explosively. However, existing methods for ...

A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronizati...