Sharing and Hit based Prioritizing Replacement Algorithm for Multi-Threaded Applications
نویسندگان
چکیده
منابع مشابه
Sharing and Hit based Prioritizing Replacement Algorithm for Multi-Threaded Applications
Cache replacement techniques like LRU, MRU etc. that are currently being deployed across multi-core architecture platforms, try to classify elements purely based on the number of hits they receive during their stay in the cache. In multithreaded applications data can be shared by multiple threads (which might run on the same core or across different cores). Such data needs to be given more prio...
متن کاملMulti-Threaded BLAO* Algorithm
We present a heuristic search algorithm for solving goal based Markov decision processes (MDPs) named Multi-threaded BLAO* (MBLAO*). Hansen and Zilberstein proposed a heuristic search MDP solver named LAO* (Hansen & Zilberstein 2001). Bhuma and Goldsmith extended LAO* to the bidirectional case (Bhuma & Goldsmith 2003) and named their solver BLAO*. Recent experiments on BLAO* (Dai & Goldsmith 20...
متن کاملLoad Balancing for Network Based Multi-threaded Applications
In this paper we present Lbs, a load-management-system for network based concurrent computing. The system is built on Pt-Pvm, a library based on the PVM system. Pt-Pvm provides message passing and process management facilities at thread and process level for a cluster of workstations running the UNIX operating system. The presented system is realized as an open library which can be easily used ...
متن کاملOffline taint prediction for multi-threaded applications
Dynamic analysis of multi-threaded applications running on parallel architectures is notoriously a challenging issue. In this work we consider taint analysis as a typical information flow property. The approach we propose extends properties collected at runtime on a single parallel execution σ∥ to a set of execution sequences corresponding to plausible serializations of σ∥. Taint values are inf...
متن کاملGlobal Invariants for Analyzing Multi-threaded Applications
We exhibit an interprocedural framework for the analysis of multi-threaded programs based on partial invariants of a new kind of constraint systems which we call side-effecting. We explore the formal properties of these constraint systems and provide general techniques for computing partial invariants. We demonstrate the practicality of this approach by designing and implementing a reasonably e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15776-4557