Fast parallel lexical analysis on multi-core machines
by Amit Barve; Brijendra Kumar Joshi
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 9, No. 3, 2016

Abstract: Lexical analysis begins the process of compilation of any source program. Various attempts have been made to improve the lexical analysis phase by exploiting the inherent parallel processing capability of multi-core machines. In this paper we present a fast lexical analysis algorithm that performs better than our previous algorithm which uses round robin approach for scheduling jobs to processors. We demonstrate the improvement in lexical analysis phase by automatically generating C programs having up to 300 potentially parallel constructs like if..else, for, while loops, switch..case, etc. The maximum speedup achieved for seven CPUs is 4.14.

Online publication date: Sat, 30-Apr-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com