Filters








95 Hits in 9.1 sec

An efficient reverse-lookup table based strategy for solving the synonym and cache coherence problem in virtually indexed, virtually tagged caches [article]

Madhav P. Desai, Aniket Deshmukh
2021 arXiv   pre-print
We describe a simple, efficient reverse lookup table based approach to address the synonym and the coherence problems in VIVT (both set associative and direct-mapped) caches.  ...  Virtually indexed and virtually tagged (VIVT) caches are an attractive option for micro-processor level-1 caches, because of their fast response time and because they are cheaper to implement than more  ...  We provide a unified solution which uses a reverse lookup table to tackle the problem of synonyms and coherency maintenance in an elegant and cost effective manner.  ... 
arXiv:2108.00444v1 fatcat:itf5bgeysvaqpbvfqfo73k7q4q

Architectural and Operating System Support for Virtual Memory

Abhishek Bhattacharjee, Daniel Lustig
2017 Synthesis Lectures on Computer Architecture  
We also thank Arka Basu, Tushar Krishna, and an anonymous reviewer for their helpful comments and suggestions to improve the quality of this book.  ...  We thank her for her support in pursuing our research endeavors. We also thank the many collaborators with whom we have explored various topics pertaining to virtual memory.  ...  On the right, we show virtually indexed and physically tagged caches, where the TLB lookup and cache set index portions are overlapped.  ... 
doi:10.2200/s00795ed1v01y201708cac042 fatcat:4re5afn53jhu7ezxwtb25ja3ca

Implementation tradeoffs in the design of flexible transactional memory support

Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. Scott
2010 Journal of Parallel and Distributed Computing  
Finally, we compare the use of an aggressive hardware controller (as used in the base FlexTM design) to manage and to access any speculative transaction state overflowed from the cache, to a hardware-software  ...  conflicts have occurred; Programmable Data Isolation, which buffers speculative updates in the local cache and uses an overflow table to handle unbounded updates; and Alert-On-Update, which notifies a  ...  On an O sig hit the SM-cache is looked up in parallel with the L2 lookup (see Figure 5 ). SM-cache misses are handled entirely by software handlers that index into it using the virtual page address.  ... 
doi:10.1016/j.jpdc.2010.03.006 fatcat:6im5tb4ihfblhaz3t5ibyjsu3y

Flexible Decoupled Transactional Memory Support

Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. Scott
2008 2008 International Symposium on Computer Architecture  
in virtual memory) only in the rare event of an overflow.  ...  ), extending it to directory-based coherence and adding a hardware-filled overflow mechanism.  ...  The physical addresses are used for associative lookup, and to eliminate synonym and homonym problems [5] .  ... 
doi:10.1109/isca.2008.17 dblp:conf/isca/ShriramanDS08 fatcat:kwyihhdwpbentfbnd4anoqzaei

Flexible Decoupled Transactional Memory Support

Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. Scott
2008 SIGARCH Computer Architecture News  
in virtual memory) only in the rare event of an overflow.  ...  ), extending it to directory-based coherence and adding a hardware-filled overflow mechanism.  ...  The physical addresses are used for associative lookup, and to eliminate synonym and homonym problems [5] .  ... 
doi:10.1145/1394608.1382134 fatcat:hnt46ouzcba3hhlrjeywq6jbrq

Data-Centric and Data-Aware Frameworks for Fundamentally Efficient Data Handling in Modern Computing Systems [article]

Nastaran Hajinazar
2021 arXiv   pre-print
demand in modern applications, and 2) is built from the ground up to understand, convey, and exploit data properties, to create opportunities for performance and efficiency improvements.  ...  There is an explosive growth in the size of the input and/or intermediate data used and generated by modern and emerging applications.  ...  Optimizations Supported by VBI In this section, we describe four key optimizations that the VBI design enables. Virtually-Indexed Virtually-Tagged Caches.  ... 
arXiv:2109.05881v1 fatcat:iwup66vxsjct3bm5thl35nzyuq

A Primer on Memory Consistency and Cache Coherence, Second Edition

Vijay Nagarajan, Daniel J. Sorin, Mark D. Hill, David A. Wood
2020 Synthesis Lectures on Computer Architecture  
Synonyms are multiple virtual addresses that map to the same physical address. Without mechanisms in place to avoid synonyms, it is possible for synonyms to simultaneously exist in a virtual cache.  ...  the problem of synonyms.  ...  turn would 8 invalidate the L1 cached copy of data1 and respond with an ack.  ... 
doi:10.2200/s00962ed2v01y201910cac049 fatcat:diry32l6dva5xbsgzuc7fvq7ie

A Survey of General-Purpose Computation on Graphics Hardware

John D. Owens, David Luebke, Naga Govindaraju, Mark Harris, Jens Krüger, Aaron E. Lefohn, Timothy J. Purcell
2007 Computer graphics forum (Print)  
The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware a compelling platform for computationally demanding tasks  ...  We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques.  ...  Govindaraju et al. suggest that the Stockham formulation of the FFT is better suited for the GPU by avoiding the need for bit reversal [GLGM06] ; in their implementation they focus on efficient cache  ... 
doi:10.1111/j.1467-8659.2007.01012.x fatcat:umw4pgwpfrgo3j3duhuc4r4ghq

A Survey of General-Purpose Computation on Graphics Hardware [article]

John D. Owens, David Luebke, Naga Govindaraju, Mark Harris, Jens Krüger, Aaron E. Lefohn, Timothy J. Purcell
2005 Eurographics State of the Art Reports  
We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques.  ...  The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware a compelling platform for computationally demanding tasks  ...  Acknowledgements Thanks to Ian Buck, Jeff Bolz, Daniel Horn, Marc Pollefeys, and Robert Strzodka for their thoughtful comments, and to the anonymous reviewers for their helpful and constructive criticism  ... 
doi:10.2312/egst.20051043 fatcat:7jved5a5v5ezjpvfgxtye5xscu

Transactional Memory, 2nd edition

Tim Harris, James Larus, Ravi Rajwar
2010 Synthesis Lectures on Computer Architecture  
If a cache line receives an ordinary coherence invalidation, then the hardware performs selected cache set Tags Index bits a membership operation of the incoming address on the local signature to check  ...  First, coherence lookups are enabled in the write-set signatures for all incoming coherence requests.  ...  Larus's research spanned a number of areas: including new and efficient techniques for measuring and recording executing programs' behavior, tools for analyzing and manipulating compiled and linked programs  ... 
doi:10.2200/s00272ed1v01y201006cac011 fatcat:25d3gvp5zrfqlgpzdzknqouofi

Peer-to-Peer based Social Networks: A Comprehensive Survey [article]

Newton Masinde, Kalman Graffi
2020 arXiv   pre-print
As a third point, it gives an overview of proposed P2P-based online social network applications, frameworks and architectures.  ...  The goals of this survey are three-fold. Firstly, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms.  ...  Overlay Function: Search and Lookup Mechanisms A resource in the case of a network is either a node or data and the problem of resource discovery is synonymous to the search and lookup problem.  ... 
arXiv:2001.02611v2 fatcat:nrvp45dy3rbnhmajtvqiect3ty

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
We present a novel algorithm for efficiently harnessing the crowd to assist in solving such planning problems.  ...  To solve this problem, we propose a new recency-based RAM-frugal cache replacement policy that approximates the least-recently-used (LRU) policy.  ...  These volunteers welcome participants, give directions, help in the sessions and on the registration desk, and generally make sure the conference is running smoothly.  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

Key Technologies of Sovereignty Network [chapter]

Hui Li, Xin Yang
2021 Co-governed Sovereignty Network  
Then, we proposed some efficient algorithms to support inter-translating and addressing for multi-identifier and huge size of hundred billion identifiers, together with the hyperbolic routing scheme forming  ...  Firstly, on application layer, we proposed a large-scale multilateral managed consortium blockchain technology named as Proof of Vote to construct the multi-identifier system (MIS) for all nations in the  ...  To solve this problem, when a flow stops sending packets, each router will detect whether the virtual queue of the flow is empty, and if not, forwards the remaining packets in the virtual queue at the  ... 
doi:10.1007/978-981-16-2670-8_4 fatcat:nmwozv3k6vekvcwgschwmdwfza

Basic Concepts [chapter]

2011 Oracle Database Performance and Scalability  
Each title brings the principles and theory of programming in-the-large and industrial strength software into focus.  ...  case histories, quantitative analysis, and technology into the project effort.  ...  To solve this problem, Oracle 8i introduced logical rowids that are based on the table's primary keys of an indexorganized table.  ... 
doi:10.1002/9781118135532.ch1 fatcat:itsggugltfdqvis5qndwmthbku

A multi-agent conversational system with heterogeneous data sources access

Eduardo M. Eisman, María Navarro, Juan Luis Castro
2016 Expert systems with applications  
, a FPU scholarship from the Ministry of Education and Science, a Torres Quevedo research contract from the Ministry of Science and Innovation, and the King Abdullah University of Science and Technology  ...  This work has been partially supported by the Spanish Ministry of Science and Technology under research project TIN2007-67984-C02-01, the regional Andalusian Government under research project TIC-P06-01424  ...  It used the Stanford Parser (Klein and Manning, 2002) , an ontology-based lookup, and usability methods such as feedback and clarification dialogs for training the system and improve its performance over  ... 
doi:10.1016/j.eswa.2016.01.033 fatcat:rxtab3emwzcpvebbwyphb7mubi
« Previous Showing results 1 — 15 out of 95 results