High performance memory requests scheduling technique for multicore processors / Walid Ahmed Mohamed Mohamed Elreedy ; Supervised Amin M. Nassar , Hossam A. H. Fahmy , Ali A. Elmoursy

By:

Walid Ahmed Mohamed Mohamed Elreedy

Contributor(s):

Material type: Text

TextLanguage: English Publication details: Cairo : Walid Ahmed Mohamed Mohamed Elreedy , 2012Description: 82 P. : plans ; 30cmOther title:

نظام جدولة عالي الأداء لطلبات الذاكرة في المعالجات متعددة الأنوية [Added title page title]

Subject(s):

Online resources:

Click here to access online

Available additional physical forms:

Issued also as CD

Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Electronics and Communication Summary: In this paper, we propose two new memory access scheduling techniques the Fair Least-Request Most Related (DLRMR) algorithm, and the Fair Issue-Queue based Most Related (FIQMR) algorithm based on the Least Reques (LREQ) algorithm and the Issue Queue based (IQ-based) algorithm respectively. The results show that FLRMR improves fairness over LREQ by 54.6% on average and speedup by 8.64% on average

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Call number	Copy number	Status	Barcode
Thesis	قاعة الرسائل الجامعية - الدور الاول	المكتبة المركزبة الجديدة - جامعة القاهرة	Cai01.13.08.M.Sc.2012.Wa.H (Browse shelf(Opens below))		Not for loan	01010110059456000
CD - Rom	مخـــزن الرســائل الجـــامعية - البدروم	المكتبة المركزبة الجديدة - جامعة القاهرة	Cai01.13.08.M.Sc.2012.Wa.H (Browse shelf(Opens below))	59456.CD	Not for loan	01020110059456000

Browsing المكتبة المركزبة الجديدة - جامعة القاهرة shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	Cai01.13.08.M.Sc.2012.Wa.B Binary floating point fused multiply add unit /	Cai01.13.08.M.Sc.2012.Wa.B Binary floating point fused multiply add unit /	Cai01.13.08.M.Sc.2012.Wa.H High performance memory requests scheduling technique for multicore processors /	Cai01.13.08.M.Sc.2012.Wa.H High performance memory requests scheduling technique for multicore processors /	Cai01.13.08.M.Sc.2012.Ya.T Three dimensional simulation of electron beam dynamics and design of medical linear accelerator /	Cai01.13.08.M.Sc.2012.Ya.T Three dimensional simulation of electron beam dynamics and design of medical linear accelerator /	Cai01.13.08.M.Sc.2013.Ah.B Broadband hich efficiency class J power amplifier for acognitive radio system /	Next

Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Electronics and Communication

In this paper, we propose two new memory access scheduling techniques the Fair Least-Request Most Related (DLRMR) algorithm, and the Fair Issue-Queue based Most Related (FIQMR) algorithm based on the Least Reques (LREQ) algorithm and the Issue Queue based (IQ-based) algorithm respectively. The results show that FLRMR improves fairness over LREQ by 54.6% on average and speedup by 8.64% on average

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer