Manar Qamhieh

Manar Qamhieh
An-Najah National University · Department of Computer Engineering

PhD

About

19
Publications
3,080
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
226
Citations
Introduction
Manar Qamhieh currently works at the Department of Computer Engineering, An-Najah National University. Manar does research in Algorithms, Real-time systems and Parallelism. Their most recent publication is 'Stretching algorithm for global scheduling of real-time DAG tasks'.
Additional affiliations
September 2014 - August 2015
Université Gustave Eiffel
Position
  • Research Assistant
February 2012 - May 2012
Position
  • Computer Systems
Description
  • Teaching Assistant
September 2011 - present
Position
  • C programming Language
Description
  • Teaching Assistant
Education
September 2011 - January 2015
Université Gustave Eiffel
Field of study
  • Real-Time Systems, Computer Engineering
September 2009 - August 2011
Ecole d'Ingénieurs ECE, Paris, France
Field of study
  • Embedded Systems
September 2003 - June 2008
An-Najah National University
Field of study
  • Computer Engineering

Publications

Publications (19)
Article
Full-text available
Choosing a university specialization is a challenging decision for high-school students. Due to the lack of guidance and limited online resources, students base their decisions on subjective perceptions of family and friends. This increases the risk of high university dropout rates, and students changing their university disciplines. To address the...
Article
Full-text available
The C programming course is mandatory for undergraduate engineering students enrolled at universities in Palestine. The programming courses are taught by applying a traditional learning method in which the programming concepts are explained theoretically and minimal practical work is applied. In addition, students receive either no formative feedba...
Article
Full-text available
Parallelism is becoming more important nowadays due to the increasing use of multiprocessor systems. A Directed Acyclic Graph (DAG) is a general model of parallel tasks with inter-subtask parallelism. It consists of a collection of dependent subtasks under precedence constraints. In this paper, we study the problem of scheduling n periodic parallel...
Thesis
Les applications temps réel durs sont celles qui doivent exécuter en respectant des contraintes temporelles. L'ordonnancement temps réel a bien été étudié sur mono-processeurs depuis plusieurs années. Récemment, l'utilisation d'architectures multiprocesseurs a augmenté dans les applications industrielles et des architectures parallèles sont proposé...
Article
Full-text available
The scheduling of parallel real-time tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) model. The complexity is due to the structure of DAG tasks and the precedence constraints between their subtasks. The trivial DAG scheduling approach is to directly app...
Article
Full-text available
In this report, we present a free software written in Java, YARTISS, which is a real-time multiprocessor scheduling simulator. It is aimed at comparing user-customized algorithms with ones from the literature on real-time scheduling. This simulator is designed as an easy-to-use modular tool in which new modules can be added without the need to deco...
Article
Full-text available
Parallelism is becoming more important nowadays due to the increasing use of multiprocessor systems. In this paper, we study the problem of scheduling periodic parallel real-time Directed Acyclic graph (DAG) tasks on m homogeneous multiprocessor systems. A DAG task is an example of inter-subtask parallelism. It consists of a collection of dependent...
Article
Full-text available
The scheduling of real-time parallel tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) parallel model. The complexity is due to the structure of the DAG tasks and the precedence constraints between their subtasks. The trivial DAG scheduling method is to a...
Conference Paper
Full-text available
This paper addresses the problem of scheduling parallel real-time tasks of Directed Acyclic Graph (DAG) model on multiprocessor systems. We propose a new scheduling method based on a subtask-level, which means that the schedulability decisions are taken based on the local temporal parameters of subtasks. This method requires modifying the subtasks...
Conference Paper
Full-text available
A parallel application is defined as the application that can be executed on multiple processors simultaneously. In software, parallelism is a useful programming technique to take advantage of the hardware advancement in processors manufacturing nowadays. In real-time systems, where tasks have to respect certain timing constraints during execution,...
Conference Paper
Full-text available
In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Directed Acyclic Graph (DAG) on multiprocessor architectures. We focus on Global Earliest Deadline First scheduling of sporadic DAG tasksets with constrained-deadlines on a system of homogeneous processors. Our contributions consist in analyzing DAG tasks...
Article
Full-text available
In energy-aware real-time systems, there are techniques to optimize the energy consumption through turning off idle processors, Dynamic Power Management (DPM) is an example of such techniques. In this paper we propose a transformation technique of graph task model into the multi-thread segment task minimizing the number of processors needed to sche...
Article
Full-text available
In this paper, we propose a dynamic global scheduling algorithm for a previously-presented specific model of real-time tasks called "Parallel Graphs" [1], based on the Least Laxity First priority assignment policy "LLF", we apply LLF policy on each subtask in the graphs individually, taking in consideration their precedence constraints. This model...
Conference Paper
Full-text available
In this paper, we present a free software written in Java, YARTISS, which is a real-time multiprocessor scheduling simulator. It is aimed at comparing user-customized algorithms with ones from the literature on real-time scheduling. This simulator is designed as an easy-to-use modular tool in which new modules can be added without the need to decom...
Article
Full-text available
In this paper, we consider parallel real-time tasks follow-ing a Directed Acyclic Graph (DAG) model. This task model is classical in embedded and industrial system applications. Each real-time task is defined by a set of subtasks under precedence constraints. With each subtask being associated a worst case execution time and a maximal degree of par...
Article
Full-text available
The Segment Stretch Transformation (SST) is an algorithm that transforms parallel Fork-Join (FJ) tasks into sequential tasks on multiprocessor systems when possible, in order to increase the schedulability of the tasksets of this model. SST is based on Task Stretch Transformation (TST) which is a transformation for the same model of tasks, but it u...
Article
Full-text available
In this paper, we focus on the scheduling of periodic fork-join real-time tasks on multiprocessor systems. Parallel real-time tasks in the fork-join model have strict parallel segments without laxity. We propose a partitioned scheduling algorithm which increases the laxity of the parallel segments and therefore the schedulability of tasksets of thi...

Projects

Projects (2)
Project
Universities and schools in Palestine use eLearning platforms such as Moodle and eschool to provide students at university and school levels with the educational material required to master the concepts in an educational course. These platforms follow the “one size fits all approach” and provide students with the same educational content regardless their different characteristics. In addition, teachers provide students with delayed formative feedback which does not take into account students’ background knowledge about the educational domain, and student’s progress. Therefore, this research aims to propose an online platform, which adapts the educational content according to students’ characteristics. In addition, the platform will help teachers generate questions and formative feedback automatically from the educational corpus to facilitate and personalize the educational process. The platform will be a generic platform, which aims to cover different subjects in the educational field, and it will contribute to the research carried out on knowledge-based systems, personalized learning environments and machine learning. The online platform will be evaluated on university students to examine the effect of the platform on students’ progress. Furthermore, teachers will evaluate the auto-generated material to assess their usefulness and usability in educational courses.