Skip to main content

2016 | OriginalPaper | Buchkapitel

Stream-Based Lossless Data Compression Hardware Using Adaptive Frequency Table Management

verfasst von : Shinichi Yamagiwa, Koichi Marumo, Hiroshi Sakamoto

Erschienen in: Big Data Benchmarks, Performance Optimization, and Emerging Hardware

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In order to treat BigData efficiently, the communication speed of the inter or the intra data path equipped on high performance computing systems that needs to treat BigData management has been reaching to very high speed. In spite of fast increasing of the BigData, the implementation of the data communication path has become complex due to the electrical difficulties such as noises, crosstalks and reflections of the high speed data connection via a single cupper-based physical wire. This paper proposes a novel hardware solution to implement it by applying a stream-based data compression algorithm called the LCA-DLT. The compression algorithm is able to treat continuous data stream without exchanging the symbol lookup table among the compressor and the decompressor. The algorithm includes a dynamic frequency management of data patterns. The management is implemented by a dynamic histogram creation optimized for hardware implementation. When the dedicated communication protocol is combined with the LCA-DLT, it supports remote data migration among the computing systems. This paper describes the algorithm design and its hardware implementation of the LCA-DLT, and also shows the compression performance including the required hardware resources.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Apostolico, A., Lonardi, S.: Off-line compression by greedy textual substitution. Proc. IEEE 88(11), 1733–1744 (2000)CrossRef Apostolico, A., Lonardi, S.: Off-line compression by greedy textual substitution. Proc. IEEE 88(11), 1733–1744 (2000)CrossRef
3.
Zurück zum Zitat Grossi, R., Gupta, A., Vitter, J.S.: High-order Entropy-compressed Text Indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms / SODA 2003, pp. 841–850. ACM (2003) Grossi, R., Gupta, A., Vitter, J.S.: High-order Entropy-compressed Text Indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms / SODA 2003, pp. 841–850. ACM (2003)
4.
Zurück zum Zitat Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of 30th IEEE Annual Symposium on Foundations of Computer Science, pp. 549–554. IEEE (1989) Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of 30th IEEE Annual Symposium on Foundations of Computer Science, pp. 549–554. IEEE (1989)
5.
Zurück zum Zitat Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51–55 (2003)CrossRef Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51–55 (2003)CrossRef
6.
Zurück zum Zitat Kieffer, J., Hui Yang, E.: Grammar-based codes: a new class of universallossless source codes. IEEE Trans. Inf. Theor. 46(3), 737–754 (2000)MATHCrossRef Kieffer, J., Hui Yang, E.: Grammar-based codes: a new class of universallossless source codes. IEEE Trans. Inf. Theor. 46(3), 737–754 (2000)MATHCrossRef
7.
Zurück zum Zitat Kuon, I., Rose, J.: Measuring the gap between FPGAs and ASICs. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 26(2), 203–215 (2007)CrossRef Kuon, I., Rose, J.: Measuring the gap between FPGAs and ASICs. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 26(2), 203–215 (2007)CrossRef
8.
Zurück zum Zitat Larsson, N., Moffat, A.: Offline dictionary-based compression. In: Proceedings of Data Compression Conference (DCC 1999), pp. 296–305. IEEE, March 1999 Larsson, N., Moffat, A.: Offline dictionary-based compression. In: Proceedings of Data Compression Conference (DCC 1999), pp. 296–305. IEEE, March 1999
9.
Zurück zum Zitat Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 346–357. VLDB Endowment (2002) Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 346–357. VLDB Endowment (2002)
10.
Zurück zum Zitat Maruyama, S., Sakamoto, H., Takeda, M.: An online algorithm for lightweight grammar-based compression. Algorithms 5(2), 214–235 (2012)MathSciNetCrossRef Maruyama, S., Sakamoto, H., Takeda, M.: An online algorithm for lightweight grammar-based compression. Algorithms 5(2), 214–235 (2012)MathSciNetCrossRef
11.
Zurück zum Zitat Metwally, A., Agrawal, D., Abbadi, A.E.: An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst. 31(3), 1095–1133 (2006)CrossRef Metwally, A., Agrawal, D., Abbadi, A.E.: An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst. 31(3), 1095–1133 (2006)CrossRef
12.
Zurück zum Zitat Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: A linear-time algorithm. J. Artif. Intell. Res. 7(1), 67–82 (1997)MATH Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: A linear-time algorithm. J. Artif. Intell. Res. 7(1), 67–82 (1997)MATH
14.
Zurück zum Zitat Yamagiwa, S., Aoki, K., Wada, K.: Performance enhancement of inter-cluster communication with software-based data compression in link layer. Proc. IASTED PDCS 2005, 325–332 (2005) Yamagiwa, S., Aoki, K., Wada, K.: Performance enhancement of inter-cluster communication with software-based data compression in link layer. Proc. IASTED PDCS 2005, 325–332 (2005)
15.
16.
Zurück zum Zitat Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530–536 (1978)MATHMathSciNetCrossRef Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530–536 (1978)MATHMathSciNetCrossRef
Metadaten
Titel
Stream-Based Lossless Data Compression Hardware Using Adaptive Frequency Table Management
verfasst von
Shinichi Yamagiwa
Koichi Marumo
Hiroshi Sakamoto
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-29006-5_11