Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “shared memory”

shared memory

2008

Server consolidation is becoming an increasingly popular technique to manage and utilize systems. This paper develops CMP memory systems for server consolidation where most sharing occurs within Virtual Machines (VMs). Our memory systems maximize shared memory accesses serviced within a VM, minimize interference among separate VMs, facilitate dynamic reassignment of VMs to processors and memory, and support content-based page sharing among VMs. We begin with a tiled architecture where each of 64 tiles contains a processor, private L1 caches, and an L2 bank. First, we reveal why single-level directory designs fail to meet workload consolidation goals. Second, we develop the paper’s central idea of imposing a two-level virtual (or logical) coherence hierarchy on a physically flat CMP that harmonizes with VM assignment. Third, we show that the best of our two virtual hierarchy (VH) variants performs 12-58 % better than the best alternative flat directory protocol when consolidating Apache, OLTP, and Zeus commercial workloads on our simulated

Cited by 0

Shared Memory

Joshua Berrett · Yale University Press eBooks · 2004

This chapter explores the memory that the cultures surrounding jazz music creates. Though these two kings of jazz, Paul Whiteman and Louis Armstrong, were sovereign in their respective kingdoms, their rule was of a domain with open borders. This domain was composed of various influences, sidemen, and sundry movers and shakers that all came together to be a part of a collective experience—one that transcended religion, race, class, and category, with a shared memory of common personal relationships with one another, and the unifying factor of their appreciation of music. It would be the events of the terror tactics of the Ku Klux Klan, and the allegation by Connie and George Immerman and Tommy Rockwell that Armstrong was guilty of breach of contract, that would spur these two giants to speak of such serious issues in their recordings. This chapter thus explores such a concept of shared memory and what events, people, and prominent figures contributed to that collective experience.

Cited by 0

shared-memory

A. N. Yzelman, D. Roose, A. N. Yzelman et al. · 2012

Cited by 0

shared-memory

Bei Li, Pieter Van Der Wolf, Koen Bertels · 2008

Cited by 0

Shared-Memory Multiprocessors

Michael L. Scott, Thomas J. Leblanc · 1987

The Psyche project at the University of Rochester aims to develop a high performance operating system to support a wide variety of models for parallel programming on a shared-memory multiprocessor. It is predicated on the assumption that no one model of process state or style of communication will prove appropriate for all applications, but that a shared-memory machine can and should support all models. Conventional approaches, such as shared memory or message passing, can be regarded as points on a continuum that reflects the degree of sharing between processes. Psyche enables fully dynamic sharing by providing a user interface based on passive data abstractions in a uniform virtual address space. It ensures that users pay for protection only when it is required by permitting lazy evaluation of protection using keys and access lists. The data abstractions define conventions for sharing the uniform address space; the tradeoff between protection and performance determines the degree to which those conventions are enforced. In the absence of protection boundaries, access to a shared abstraction can be as efficient as a procedure call or a pointer dereference.

Cited by 0

5. SHARED MEMORY

Joshua Berrett · Yale University Press eBooks · 2017

Cited by 0

Shared‐Memory Switches

H. Jonathan Chao, Cheuk H. Lam, Eiji Oki · 2001

Chapter 4 details the operation principles in different design approaches of shared-memory switches, including linked list, content-addressable memory (CAM), space-time-space, multistage. It also covers multicasting methods in shared-memory switches, including multicast logic queue, cell copy circuit, and address copy circuit.

Cited by 0

Cooperative shared memory

Mark D. Hill, James R. Larus, Steven K. Reinhardt et al. · ACM SIGPLAN Notices · 1992

We believe the absence of massively-parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware designers which cases are common (so they can build simple hardware to optimize them). Cooperative shared memory , our approach to shared-memory design, addresses this problem. Our initial implementation of cooperative shared memory uses a simple programming model, called Check-In / Check-Out (CICO) , in conjunction with even simpler hardware, called Dir 1 SW is a minimal director protocol that adds little complexity to message-passing hardware, but efficiently supports programs written within the CICO model.

Cited by 3

Distributed Shared Memory

Ratan K. Ghosh, Hiranmay Ghosh · 2023

A many-core distributed system consists of multiple multi-core node clusters connected via network on chips (NoCs). Scaling up performance on a many-core system requires careful partitioning and placement of data to extract maximum parallelism. Furthermore, there are technological innovations with specialized hardware which accelerate performance. These include graphics processing unit (GPU), field programmable gateway arrays (FPGAs), and machine/deep learning (ML/DL) accelerators like Google's tensor processing unit (TPU). Simultaneously, intensive research on programming newer architecture led to the discovery of diverse computing abstractions such as MapReduce, Spark, and Dryad for data-parallel applications on these systems. These days, large-scale data-intensive applications like page rank, placement of ads, and social networks are implemented using many-core distributed systems. There is no single abstraction that fits all data-parallel applications. As a result, the applications performing well in one model perform poorly in another. The programmers find the context switching from one abstraction to another difficult, and their productivity suffers. Software distributed shared memory (S-DSM) research saw a resurgence with newer computing platforms. From a programmer's perspective, the shared memory programming model is a natural extension of the uniprocessor memory model on a distributed system. S-DSM implementation is transparent to the programmer. So, it allows the programmers to handle synchronizations in the familiar shared memory model. Their productivity is unhindered by the complexity of message-passing. The biggest challenge in S-DSM implementation is maintaining the consistency of shared variables. Inconsistent values of shared variables lead to a program's behavior being different from the programmer's expectations.

Cited by 5

Shared Memory Multiprocessor

Ankush Saini, Inderjeet Singh Behl, Jaideep Verma · 2014

ABSTRACT: Synchronization is a critical operation in many parallel applications. Conservative Synchronization mechanisms are failing to keep up with the increasing demand for well-organized management operations as systems grow larger and network latency increases. The charity of this paper is threefold. First, we revisit some delegate bringing together algorithms in light of recent architecture innovation and provide an example of how the simplify assumption made by typical logical models of management mechanism can lead to significant performance guess errors. Second, we present an architectural modernism called active memory that enables very fast tiny operations in a shared-memory multiprocessor. Third, we use execution-driven simulation to quantitatively compare the performance of a variety of Synchronization mechanisms based on both existing hardware techniques and active memory operations. To the best of our knowledge, management based on active memory out forms all existing spinlock and non-hardwired difficulty implementations by a large border.

Cited by 0

Unified Shared Memory

James Reinders, Ben Ashbaugh, James Brodman et al. · Apress eBooks · 2023

Abstract Chapter 6 discusses Unified Shared Memory (USM) in detail. USM is a pointer-based strategy for data management. This chapter describes the three types of USM allocations, how to allocate and deallocate USM memory, and how different types of USM data movement can be explicitly in our applications or implicitly controlled by the system.

Cited by 0Open access