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

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

2015
Igor S. Stievano Ivan A. Maio Flavio G. Canavero

This paper addresses the development of macromodels for input and output ports of a digital device. The proposed macromodels consist of parametric representations that can be obtained from port transient waveforms at the device ports via a well established procedure. The models are implementable as SPICE subcircuits and their accuracy and efficiency are verified by applying the approach to the ...

2006
Miri Kopel Ben-Nissan Shmuel Tomi Klein

A combination of new compression methods is suggested in order to compress the concordance of a large Information Retrieval system. The methods are aimed at allowing most of the processing directly on the compressed file, requesting decompression, if at all, only for small parts of the accessed data, saving I/O operations and CPU time.

2003
Seung-Ho Lim Joo Young Hwang Kyung Ho Kim Jupyung Lee Kyu Ho Park

In this paper, a volume management scheme that supports multi-host environments is designed and implemented. The proposed scheme provides various features for enterprise internet services such as online resizing, online migration and an enhanced configuration scheme considering workload access patterns and disk geometry. The SANfs is a shared file system in which multiple hosts can share multip...

2010
Anil Madhavapeddy Richard Mortier Ripduman Sohan Thomas Gazagnaire Steven Hand Tim Deegan Derek McAuley Jon Crowcroft

The wide availability of cloud computing offers an unprecedented opportunity to rethink how we construct applications. The cloud is currently mostly used to package up existing software stacks and operating systems (e.g. LAMP) for scaling out websites. We instead view the cloud as a stable hardware platform, and present a programming framework which permits applications to be constructed to run...

1997
Jop F. Sibeyn Michael Kaufmann

In this paper we present a paradigm for solving external-memory problems, and illustrate it by algorithms for matrix multiplication, sorting and list ranking. Our paradigm is based on the use of BSP algorithms. The correspondence is almost perfect, and especially the notion of x-optimality carries over to algorithms designed according to our paradigm. The advantages of the approach are similar ...

2007
Rishi Rakesh Sinha Arash Termehchy Soumyadeb Mitra Marianne Winslett

Even traditional commercial database systems do not scale to the size of today’s large scientific data sets, whose growth is outpacing Moore’s Law. Instead, scientists are wedded to special-purpose data formats and their associated I/O libraries, even though these libraries provide only basic functionality. Thus there is a need for a scalable data management system that can support these format...

Journal: :Concurrency and Computation: Practice and Experience 2010
Pavan Balaji Wu-chun Feng Heshan Lin Jeremy S. Archuleta Satoshi Matsuoka Andrew S. Warren João Carlos Setubal Ewing L. Lusk Rajeev Thakur Ian T. Foster Daniel S. Katz Shantenu Jha K. Shinpaugh Susan Coghlan Daniel A. Reed

Achieving high performance for distributed I/O on a wide-area network continues to be an elusive holy grail. Despite enhancements in network hardware as well as software stacks, achieving high-performance remains a challenge. In this paper, our worldwide team took a completely new and non-traditional approach to distributed I/O, called ParaMEDIC: Parallel Metadata Environment for Distributed I/...

Journal: :IJPEDS 2012
Grant Mackey Saba Sehrish Christopher Mitchell John Bent Jun Wang

Emerging scientific workflows in HPC focus more on analysis rather than simulation. Simulation output is so dense with information that copious amounts of analysis must be performed on a single output to understand the results of that simulation. We identify this repetitive analysis as a new application type, Simulate Once Analyze Repeatedly (SOAR) Computing. Current scientific HPC, when extend...

2017
Walter Terkaj Giovanni Paolo Viganò

This paper presents an ontology-based Virtual Factory tool to support the 3D design of factories. The official ifcOWL is the reference ontology that was adopted to develop the I/O software connector of the tool. The key advantage of the ontology interface is represented by the easy integration with other software tools that can either use the layout generated by GIOVE-VF or provide information ...

1997
James Zijun Wang Kien A. Hua

Using magnetic disks as a cache for tertiary storage has been shown to be an effective way to address the high storage costs of large-scale multimedia servers. We investigate a technique for managing the bandwidth of such a hierarchical storage design. In existing schemes, all data items are treated equally; and the same I/O rate is used to load data from tertiary storage when they are requeste...

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

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