ANT COLONY SCHEDULING FOR NETWORK ON CHIP

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.

DOUSTTALAB NEDA; JABRAEIL JAMALI MUHAMMAD ALI; GHAFFARI ALI

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

Journal Paper

Paper Information

Journal: Journal of Information Systems and Telecommunication Year:2015 | Volume:3 | Issue:2 Page(s): 95-99

Download Full-Text

View:

439

Download:

135

Cites:

Information Journal Paper

Title

ANT COLONY SCHEDULING FOR NETWORK ON CHIP

Author(s)

DOUSTTALAB NEDA | JABRAEIL JAMALI MUHAMMAD ALI | GHAFFARI ALI | Issue Writer Certificate

Keywords

ON-CHIP INTERCONNECTION NETWORKS

SWITCH ALLOCATOR

ANT COLONY

SCHEDULING

Abstract

It is undeniable that SCHEDULING plays an important role in increasing the network quality on chip. If experts realize the significant of mapping and SCHEDULING in getting rid of delays and increasing performance of these systems, they will ponder over these activities much more scrupulously. The operation SCHEDULING problem in network on chip (NoC) is NP-hard; therefore, effective heuristic methods are needed to provide modal solutions. In this paper, ANT COLONY SCHEDULING was introduced as a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with complex topology and asymmetric traffic patterns. The proposed algorithm was studied in torus and flattened-butterfly topologies with multiple types of traffic pattern. For evaluating the performance of the proposed algorithm, specialized simulator network on chip entitled by BookSim working under Linux operation system was used. Evaluation results showed that this algorithm, in many causes, had positive effects on reducing network delays and increasing chip performance compared with other algorithms. For instance, for a complex topologies, this algorithm under maximum injection_rate of up to (10%) increasing throughput have been observed, injection rate, on average, compared to other existing algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

DOUSTTALAB, NEDA, JABRAEIL JAMALI, MUHAMMAD ALI, & GHAFFARI, ALI. (2015). ANT COLONY SCHEDULING FOR NETWORK ON CHIP. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 3(2), 95-99. SID. https://sid.ir/paper/332671/en

Vancouver: Copy

DOUSTTALAB NEDA, JABRAEIL JAMALI MUHAMMAD ALI, GHAFFARI ALI. ANT COLONY SCHEDULING FOR NETWORK ON CHIP. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2015;3(2):95-99. Available from: https://sid.ir/paper/332671/en

IEEE: Copy

NEDA DOUSTTALAB, MUHAMMAD ALI JABRAEIL JAMALI, and ALI GHAFFARI, “ANT COLONY SCHEDULING FOR NETWORK ON CHIP,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 3, no. 2, pp. 95–99, 2015, [Online]. Available: https://sid.ir/paper/332671/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops