POWER2 fixed-point, data cache, and storage control units

1994 ◽  
Vol 38 (5) ◽  
pp. 503-524
Author(s):  
D. J. Shippy ◽  
T. W. Griffith
2010 ◽  
Vol E93-C (3) ◽  
pp. 361-368
Author(s):  
Benjamin CARRION SCHAFER ◽  
Yusuke IGUCHI ◽  
Wataru TAKAHASHI ◽  
Shingo NAGATANI ◽  
Kazutoshi WAKABAYASHI

2020 ◽  
Author(s):  
Rostislav Kouznetsov

Abstract. Lossy compression of scientific data arrays is a powerful tool to save network bandwidth and storage space. Properly applied lossy compression can reduce the size of a dataset by orders of magnitude keeping all essential information, whereas a wrong choice of lossy compression parameters leads to the loss of valuable data. The paper considers statistical properties of several lossy compression methods implemented in "NetCDF operators" (NCO), a popular tool for handling and transformation of numerical data in NetCDF format. We compare the effects of imprecisions and artifacts resulting from use of a lossy compression of floating-point data arrays. In particular, we show that a popular Bit Grooming algorithm (default in NCO) has sub-optimal accuracy and produces substantial artifacts in multipoint statistics. We suggest a simple implementation of two algorithms that are free from these artifacts and have twice higher precision. Besides that, we suggest a way to rectify the data already processed with Bit Grooming. The algorithm has been contributed to NCO mainstream. The supplementary material contains the implementation of the algorithm in Python 3.


Author(s):  
Hsin-Te Wu ◽  
Hsin-Hung Cho ◽  
Sheng-Jie Wang ◽  
Fan-Hsun Tseng

AbstractContent cache as well as data cache is vital to Content Centric Network (CCN). A sophisticated cache scheme is necessary but unsatisfied currently. Existing content cache scheme wastes router’s cache capacity due to redundant replica data in CCN routers. The paper presents an intelligent data cache scheme, viz content popularity and user location (CPUL) scheme. It tackles the cache problem of CCN routers for pursuing better hit rate and storage utilization. The proposed CPUL scheme not only considers the location where user sends request but also classifies data into popular and normal content with correspond to different cache policies. Simulation results showed that the CPUL scheme yields the highest cache hit rate and the lowest total size of cache data with compared to the original cache scheme in CCN and the Most Popular Content (MPC) scheme. The CPUL scheme is superior to both compared schemes in terms of around 8% to 13% higher hit rate and around 4% to 16% lower cache size. In addition, the CPUL scheme achieves more than 20% and 10% higher cache utilization when the released cache size increases and the categories of requested data increases, respectively.


Author(s):  
Axel G. Braun ◽  
Djones V. Lettnin ◽  
Joachim Gerlach ◽  
Wolfgang Rosenstiel
Keyword(s):  

Author(s):  
Toshiyuki Dobashi ◽  
Atsushi Tashiro ◽  
Masahiro Iwahashi ◽  
Hitoshi Kiya

A tone mapping operation (TMO) for HDR images with fixed-point arithmetic is proposed. A TMO generates a low dynamic range (LDR) image from a high dynamic range (HDR) image by compressing its dynamic range. Since HDR images are generally expressed in a floating-point data format, a TMO also deals with floating-point data even though resulting LDR images have integer data. As a result, conventional TMOs require many resources such as computational and memory cost. To reduce the resources, an integer TMO which treats a floating-point number as two 8-bit integer numbers was proposed. However, this method has the limitation of available input HDR image formats. The proposed method introduces an intermediate format to relieve the limitation of input formats, and expands the integer TMO for the intermediate format. The proposed integer TMO can be applied for multiple formats such as the RGBE and the OpenEXR. Moreover, the method can conduct all calculations in the TMO with fixed-point arithmetic. Using both integer data and fixed-point arithmetic, the method reduces not only the memory cost, but also the computational cost. The experimental and evaluation results show that the proposed method reduces the computational and memory cost, and gives almost same quality of LDR images, compared with the conventional method with floating-point arithmetic.


Author(s):  
Karl Heinz Dovermann ◽  
Ted Petrie ◽  
Reinhard Schultz

Sign in / Sign up

Export Citation Format

Share Document