NDLI: Near optimal compression with respect to a static dictionary on a practical massively parallel architecture

Content Provider	IEEE Xplore Digital Library
Author	Belinskaya, D. DeAgostino, S. Storer, J.A.
Copyright Year	1995
Description	Author affiliation: Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA (Belinskaya, D.; DeAgostino, S.; Storer, J.A.)
Abstract	We consider sublinear massively parallel algorithms for compressing text with respect to a static dictionary. Algorithms for the PRAM model can do this optimally in O(m+log(n)) time with n processors, where m is the length of the longest entry in the dictionary and n is the length of the input string. We consider what is perhaps the most practical model of massively parallel computation imaginable: a linear array of processors where each processor is connected only to its left and right neighbors. We present an algorithm which in time O(km+mlog(m)) with n/(km) processors is guaranteed to be within a factor of (k+1)/k of optimal, for any integer k/spl ges/1. We also present experiments indicating that performance may be even better in practice.
Starting Page	172
Ending Page	181
File Size	484302
Page Count	10
File Format	PDF
ISBN	0818670126
ISSN	10680314
DOI	10.1109/DCC.1995.515507
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-03-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Dictionaries Parallel algorithms Phase change random access memory Concurrent computing Parallel architectures Computer science Real time systems Books Very large scale integration Heuristic algorithms
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Practical Parallel Algorithms for Dictionary Data Compression

PRAM algorithms for static dictionary compression

Parallel parsing algorithms for static dictionary compression

Parallel data compression algorithms

Parallel algorithms for the static dictionary compression

Parallel Methods for Vlsi Layout Design

Static task allocation for heterogeneous distributed computing systems

Parallel algorithms for optimal compression using dictionaries with the prefix property

Massively parallel processing: It's Déjà Vu all over again

Near optimal compression with respect to a static dictionary on a practical massively parallel architecture

Similar Documents

Practical Parallel Algorithms for Dictionary Data Compression

PRAM algorithms for static dictionary compression

Parallel parsing algorithms for static dictionary compression

Parallel data compression algorithms

Parallel algorithms for the static dictionary compression

Parallel Methods for Vlsi Layout Design

Static task allocation for heterogeneous distributed computing systems

Parallel algorithms for optimal compression using dictionaries with the prefix property

Massively parallel processing: It's Déjà Vu all over again

Near optimal compression with respect to a static dictionary on a practical massively parallel architecture