RASMAP: AN EFFICIENT HEURISTIC APPLICATION MAPPING ALGORITHM FOR NETWORK-ON-CHIPS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Seidi piri Rasoul; Patooghy Ahmad; Afsharpour Sima; FAZELI MAHDI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY
Year:2016 | Issue:8

Download Full-Text

View:

139

Download:

Information Seminar Paper

Title

RASMAP: AN EFFICIENT HEURISTIC APPLICATION MAPPING ALGORITHM FOR NETWORK-ON-CHIPS

Author(s)

Seidi piri Rasoul | Patooghy Ahmad | Afsharpour Sima | FAZELI MAHDI | Issue Writer Certificate

Keywords

MAPPING

NOC

MESH

MULTI-CORE

TASK

Abstract

THIS PAPER PROPOSES AND EVALUATES A PERFORMANCE EFFICIENT APPLICATION MAPPING ALGORITHM FOR MESH-BASED NOCS. THE PROPOSED ALGORITHM FIRST PRIORITIZES TASKS OF THE GIVEN APPLICATION GRAPH BASED ON THEIR TOTAL IN/OUT COMMUNICATION TRAFFIC. THEN A TASK WITH THE MOST COMMUNICATION TRAFFIC IS SELECTED AND MAPPED ONTO THE CENTER PART OF THE MESH TOPOLOGY I.E., A CORE WITH THE MOST AVAILABLE COMMUNICATION CHANNELS. AFTER THAT, REPEATEDLY, THE NEXT TASK IS SELECTED IN A WAY THAT HAS THE MOST COMMUNICATIONS WITH THE ALREADY MAPPED TASKS. SUCH A TASK IS MAPPED ONTO THE CORE WHICH ITS DEGREE IS PROPORTIONAL TO THE TASKS LINK DEGREE. THE PROPOSED METHOD IS EVALUATED BY NOXIM WHICH IS A CYCLE-ACCURATE NOC SIMULATOR IN TERMS OF COMMUNICATION COST I.E., TO TOTAL NUMBER OF PACKETS TRAVERSED THROUGH THE NETWORK TO COMPLETE THE APPLICATION GRAPH. THE PROPOSED METHOD IS COMPARED WITH SEVERAL PREVIOUSLY PROPOSED MAPPING ALGORITHMS INCLUDING NMAP, CMAP, LMAP, PSMAP, CASTNET. COMPARISONS SHOW THAT THE PROPOSED METHOD OFFERS BETTER PERFORMANCE AND CONSUMES LOWER ENERGY IN THE NETWORK.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Seidi piri, Rasoul, Patooghy, Ahmad, Afsharpour, Sima, & FAZELI, MAHDI. (2016). RASMAP: AN EFFICIENT HEURISTIC APPLICATION MAPPING ALGORITHM FOR NETWORK-ON-CHIPS. INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY. SID. https://sid.ir/paper/947565/en

Vancouver: Copy

Seidi piri Rasoul, Patooghy Ahmad, Afsharpour Sima, FAZELI MAHDI. RASMAP: AN EFFICIENT HEURISTIC APPLICATION MAPPING ALGORITHM FOR NETWORK-ON-CHIPS. 2016. Available from: https://sid.ir/paper/947565/en

IEEE: Copy

Rasoul Seidi piri, Ahmad Patooghy, Sima Afsharpour, and MAHDI FAZELI, “RASMAP: AN EFFICIENT HEURISTIC APPLICATION MAPPING ALGORITHM FOR NETWORK-ON-CHIPS,” presented at the INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY. 2016, [Online]. Available: https://sid.ir/paper/947565/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops