Realising constant time parallel algorithms with active memory modules
by Martti Forsell
International Journal of Electronic Business (IJEB), Vol. 3, No. 3/4, 2005

Abstract: Recent advances in emulated shared memory architectures have made it possible to exploit the full power of a scalable parallel hardware in an easy-to-program form. Unfortunately, the obtained model of computing does not allow efficient parallel access to a single memory cell leaving the lower bound of the execution time of many important parallel algorithms logarithmic. In this paper, we describe a simple active memory based modification on memory module architecture that eliminates this limitation in many cases. Both algorithmic and real life examples are given. The resulting architecture can be used as a scalable processing infrastructure building block for general purpose applications like e-business, e-education, e-science, and e-medicine on the internet.

Online publication date: Thu, 30-Jun-2005

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 Electronic Business (IJEB):
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