header
Image from OpenLibrary

Task scheduling in distributed memory systems using fuzzy logic / Rasha Mohamed Zohier Mostafa ; Supervised Fatma Omara , Mahmoud Riad

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Rasha Mohamed Zohier Mostafa , 2011Description: 149 P. : charts ; 30cmOther title:
  • جدولة المهام فى نظم الذاكرة الموزعة بإستخدام المنطق الفازى [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Institute of Statistical Studies and Research - Department of Computer and Information Science Summary: Task scheduling is a very critical problem in parallel and distributed systems especially with the urge of great computational capabilities. The use of distributed memory system and other computing networks is the first alternative to choose instead of buying very expensive supercomputers. The scheduling problem is considered NP complete in its general forms and optimal solutions are known only in restricted cases
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.18.02.M.Sc.2011.Ra.T (Browse shelf(Opens below)) Not for loan 01010110058049000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.18.02.M.Sc.2011.Ra.T (Browse shelf(Opens below)) 58049.CD Not for loan 01020110058049000

Thesis (M.Sc.) - Cairo University - Institute of Statistical Studies and Research - Department of Computer and Information Science

Task scheduling is a very critical problem in parallel and distributed systems especially with the urge of great computational capabilities. The use of distributed memory system and other computing networks is the first alternative to choose instead of buying very expensive supercomputers. The scheduling problem is considered NP complete in its general forms and optimal solutions are known only in restricted cases

Issued also as CD

There are no comments on this title.

to post a comment.