Amr Zaky

Followers

Following

Co-author

Public Views

Julita Vassileva

University of Saskatchewan

Cristina Bicchieri

University of Pennsylvania

Maurizio Forte

Duke University

David Seamon

Kansas State University

Qusay F. Hassan

Sparsh Mittal

Indian Institute Of Technology, Roorkee

Kamal Youcef-toumi

Massachusetts Institute of Technology (MIT)

ambika durai

Anna University

Amirali Baniasadi

University of Victoria BC

João António Madeiras Pereira

Instituto Superior Técnico

Interests

Uploads

Papers by Amr Zaky

Optimal Static Scheduling of Sequential Loops on Multiprocessors

International Conference on Parallel Processing, 1989

Optimal static scheduling of sequential loops on multiprocessors. AMR ZAKY, PSADAYAPPAN 1989 Inte... more

Granularity Management for a Large-Grain Data Flow Multiprocessor

Large-Grain DAta Flow (LGDF) multiprocessors provide a natural environment for executing computat... more Large-Grain DAta Flow (LGDF) multiprocessors provide a natural environment for executing computationally-demanding real time applications (e.g. signal processing). First, expressing the application as a task graph of previously defined primitives, eases the development process and exposes the natural parallelism in the application. Second, the low-overhead dynamic scheduling strategies used in LGDF multiprocessor provide a certain degree of fault tolerance-a crucial requirement in critical real time applications. We are studying the problem of improving the periodic execution schedules for such graphs by manipulating the computation and communication granularity. Our testbed is a model for a uniform memory access static data flow multiprocessor, e.g. the AN/UYS-2.

Efficient static scheduling of loops on synchronous multiprocessors

This dissertation investigates efficient compile-time scheduling techniques for exploiting parall... more This dissertation investigates efficient compile-time scheduling techniques for exploiting parallelism on synchronous multiprocessors. Synchronous multiprocessors, e.g. Very Long Instruction Word (VLIW) machines, are very effective in utilizing unstructured fine-grained parallelism in programs. The effectiveness of such machines is crucially dependent on the static compile-time analysis and detection of potential parallelism. The first part of the dissertation focuses on scheduling sequential loops on multiprocessors with multiple identical processor units. The problem of determining the maximal initiation rate for the execution of a sequential loop with uniform dependence distances on a synchronous multiprocessor is addressed and cast as an eigenvalue problem in a path algebra. A low-order polynomial algorithm for the determination of the optimal loop initiation rate is developed, and a schedule that exploits fine-grained parallelism and achieves the optimal initiation rate is deve...

Grain size Management in Repetitive Task Graphs for Multiprocessor Computer Scheduling

Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard pr... more Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard problem. Because of this, most scheduling algorithms in use today rely on heuristics to determine the best balance of computation and communication costs. However, because of the NP-hard nature of the problem, these heuristics have become very complex. We are concerned with a specific instance of the problem, throughput scheduling, which aims to optimize the completion rate of repetitive programs, expressed as task graphs, for which the computational and communication needs of the tasks are known in advance. We propose a simpler approach for finding better schedules, which involves testing different grain size modified versions of the task graph to find the one that results in the highest throughput for the given scheduling algorithm. Our heuristic works by alternately fusing or fissioning selected tasks of the graph then evaluating the modified task graph by measuring the expected through...

Tools and Environments for Parallel and Distributed Systems

From the Publisher: Developing correct and efficient software is far more complex for parallel an... more From the Publisher: Developing correct and efficient software is far more complex for parallel and distributed systems than it is for sequential processors. Some of the reasons for this added complexity are: the lack of a universally acceptable parallel and distributed programming paradigm, the criticality of achieving high performance, and the difficulty of writing correct parallel and distributed programs. These factors collectively influence the current status of parallel and distributed software development tools efforts. Tools And Environments For Parallel And Distributed Systems addresses the above issues by describing working tools and environments, and gives a solid overview of some of the fundamental research being done worldwide. Topics covered in this collection are: Mainstream program development tools; performance prediction tools and studies; debugging tools and research; and nontraditional tools. Tools And Environments For Parallel And Distributed Systems is suitable as a secondary text for graduate level courses in software engineering and parallel and distributed systems, and as a reference for researchers and practitioners in industry.

Real-Time Execution Control of Task-Level Data-Flow Graphs Using a Compile-Time Approach

Unclassified 2a. SECURITY CLASSIFICATION AUTHORITY 3. DISTRIBUTION/AVAILABILIIf OF REPORT 2b. DEC... more Unclassified 2a. SECURITY CLASSIFICATION AUTHORITY 3. DISTRIBUTION/AVAILABILIIf OF REPORT 2b. DECLASSIFICATION/DOIGRADIING SCHEDULE Approved for public release: distribution is unlimited. 4. PERFORMING ORGANIZATION REPORT NlUMBER(S) 5. MONITORING ORGANIZATION REPORT NUMBER(S) NPS-EC-92-007 6a. NAME OF PERFORMING ORGAIIZATION 6b. OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION Dept. of Elect. & Comp. Eng.

Download

Optimal Static Scheduling of Sequential Loops on Multiprocessors

Optimal static scheduling of sequential loops on multiprocessors. AMR ZAKY, PSADAYAPPAN 1989 Inte... more

An object-oriented approach to computer architecture simulation

Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences, 1992

An object-oriented approach to modeling and simulation computer architectures is presented. Rathe... more An object-oriented approach to modeling and simulation computer architectures is presented. Rather than concentrating on a specific system, the more generic concepts of processors, memories, clocks, registers, instruction sets, etc. are developed. By building upon these basic concepts, it is then possible to simulate virtually any processor to nearly any level of detail

Granularity Management for a Large-Grain Data Flow Multiprocessor

Parallel Processing for Scientific Computing, 1995

A Compile-Time Technique for Contorlling Real-Time Execution of Task-Level DataFlow Graphs

International Conference on Parallel Processing, 1992