نتایج جستجو برای: binary mapped historical memory management

تعداد نتایج: 1333173  

Journal: :Ciències: revista del professorat de ciències de Primària i Secundària 2020

1989
Anthony C. Barkans

Described is a display sub-system, designed for support of a very high speed rendering engine. It provides high-performance graphics to an enVironment that consists of a hierarchy of resizable windows. The concept of virtual memory has been applied with the organization of the virtual to physical address spaces having a unique mapping that fits the organization of a bit-mapped graphics memory d...

Journal: :J. Parallel Distrib. Comput. 1997
Angelos Bilas Edward W. Felten

The emergence of new network interface technology is enabling new approaches to the development of communications software. This paper evaluates the SHRIMP virtual memory mapped network interface by using it to build two fast implementations of remote procedure call (RPC). Our rst implementation, called vRPC, is fully compatible with the SunRPC standard. We change the RPC runtime library; the o...

Journal: :Problems of World History 2020

1996
David Kotz Preston Crow

Trends toward shared-memory programming paradigms, large (64-bit) address spaces, and memory-mapped les have led some to propose the use of a single virtual-address space, shared by all processes and processors. To simplify address-space management, some have claimed that a 64-bit address space is suuciently large that there is no need to ever re-use addresses. Unfortunately, there has been no ...

1997
Vincenzo Auletta Amelia De Vivo Vittorio Scarano

We study the problem of mapping the N nodes of a data structure on M memory modules so that they can be accessed in parallel by templates i.e. distinct sets of nodes. In literature several algorithms are available for arrays (accessed by rows, columns, diagonals and subarrays) and trees (accessed by subtrees, root-to-leaf paths, etc.). Although some mapping algorithms for arrays allow conflict-...

1996
Peter A. Buhr Anil K. Goel Naomi Nishimura Prabhakar Ragde

Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. Buhr, Goel, and Wai [11] have shown that data structures such as B-Trees, R-Trees and graph data structures can be implemented as efficiently and effectively in this environment as in a traditional environment using exp...

Journal: :Journal of Interconnection Networks 2001
David Riddoch Steve Pope Derek Roberts Glenford E. Mapp David Clarke David Ingram Kieran Mansley Andy Hopper

Existing user-level network interfaces deliver high bandwidth, low latency performance to applications, but are typically unable to support diverse styles of communication and are unsuitable for use in multiprogrammed environments. Often this is because the network abstraction is presented at too high a level, and support for synchronisation is inflexible. In this paper we present a new primiti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید