Mohamed A. Bamakhrama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohamed A. Bamakhrama has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Todor Stefanov
Leiden University, Leiden, The Netherlands
4 shared publicationsJiali Teddy Zhai
Leiden University, Leiden, The Netherlands
2 shared publicationsA. E. Agamy
IEEE Student Member, Department of Computer Engineering, University of Sharjah
1 shared publicationA. Z. Hatahet
IEEE Student Member, Department of Computer Engineering, University of Sharjah
1 shared publicationEmanuele Cannella
Leiden Inst. of Adv. Comput. Sci., Leiden Univ., Leiden, Netherlands
1 shared publicationHristo Nikolov
Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands
1 shared publication
Latest Publications
- Open Access
- 28 May 2018
- Published by Association for Computing Machinery (ACM)
- p. 47-53
Fast and Portable Vector DSP Simulation Through Automatic Vectorization
- 28 May 2018
- Published by Association for Computing Machinery (ACM)
- p. 47-53
Open AccessFast and Portable Vector DSP Simulation Through Automatic Vectorization
- 1 January 2014
- Published by EDAA
- p. 1-6
System-level scheduling of real-time streaming applications using a semi-partitioned approach
Modern multiprocessor streaming systems have hard real-time constraints that must be always met to ensure correct functionality. At the same time, these streaming systems must be designed to use the minimum required amount of resources (such as processors and memory). In order to meet such constraints, using scheduling algorithms from the classical real-time scheduling theory represents an attractive solution approach. These algorithms enable: (1) providing timing guarantees to the applications running on the system, and (2) deriving analytically the minimum number of processors required to schedule the applications. So far, designers in the embedded systems community have focused on global and partitioned scheduling algorithms. However, recently, a new hybrid class of scheduling algorithms has been proposed. In this work, we investigate the applicability of a sub-class of these hybrid algorithms, called semi-partitioned algorithms, to applications modeled as Cyclo-Static Dataflow (CSDF) graphs. The contribution of this paper is two fold. First, we devise an approach that enables semi-partitioned scheduling algorithms, even soft real-time ones, to be applied to CSDF graphs while providing hard real-time guarantees at the input/output interfaces with the external environment. Second, we focus on an existing soft real-time semi-partitioned approach, for which we propose an allocation heuristic, called FFD-SP. The proposed heuristic reduces the minimum number of processors required to schedule the applications compared to a pure partitioned scheduling algorithm, while trying to minimize the buffer size and latency increases incurred by the soft real-time approach.
- 1 January 2014
- Published by EDAA
- p. 1-6
System-level scheduling of real-time streaming applications using a semi-partitioned approach
Modern multiprocessor streaming systems have hard real-time constraints that must be always met to ensure correct functionality. At the same time, these streaming systems must be designed to use the minimum required amount of resources (such as processors and memory). In order to meet such constraints, using scheduling algorithms from the classical real-time scheduling theory represents an attractive solution approach. These algorithms enable: (1) providing timing guarantees to the applications running on the system, and (2) deriving analytically the minimum number of processors required to schedule the applications. So far, designers in the embedded systems community have focused on global and partitioned scheduling algorithms. However, recently, a new hybrid class of scheduling algorithms has been proposed. In this work, we investigate the applicability of a sub-class of these hybrid algorithms, called semi-partitioned algorithms, to applications modeled as Cyclo-Static Dataflow (CSDF) graphs. The contribution of this paper is two fold. First, we devise an approach that enables semi-partitioned scheduling algorithms, even soft real-time ones, to be applied to CSDF graphs while providing hard real-time guarantees at the input/output interfaces with the external environment. Second, we focus on an existing soft real-time semi-partitioned approach, for which we propose an allocation heuristic, called FFD-SP. The proposed heuristic reduces the minimum number of processors required to schedule the applications compared to a pure partitioned scheduling algorithm, while trying to minimize the buffer size and latency increases incurred by the soft real-time approach.
- Open Access
- 29 May 2013
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Exploiting just-enough parallelism when mapping streaming applications in hard real-time systems
- 29 May 2013
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessExploiting just-enough parallelism when mapping streaming applications in hard real-time systems
- Open Access
- 7 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 83-92
Managing latency in embedded streaming applications under hard-real-time scheduling
In this paper, we consider the problem of hard-real-time scheduling of embedded streaming applications, modeled using dataflow graphs, while minimizing the application latency. Recently, it has been shown that the actors in an acyclic Cyclo-Static Dataflow (CSDF) graph can be scheduled as a set of implicit-deadline periodic tasks. Such scheduling approach has been shown to yield the maximum achievable throughput for a large set of graphs, called matched I/O rates graphs. We show that scheduling the graph actors as implicit-deadline periodic tasks increases the latency significantly for a class of graphs called unbalanced graphs. To alleviate this problem, we propose a new task-set representation for the actors in which the actors are scheduled as a set of constrained-deadline periodic tasks. We prove that scheduling the actors as constrained-deadline periodic tasks delivers optimal throughput (i.e., rate) and latency for graphs with repetition vector equal to $\vec{1}$. Furthermore, we evaluate the constrained-deadline representation using a set of 19 real-life applications and show that it is capable of achieving the minimum achievable latency for more than 70% of the applications, and even if the application has a repetition vector not equal to $\vec{1}$. We show that choosing the task deadline involves a trade-off between the latency and the resources requirements. Finally, we propose a decision tree to assist the designer in choosing the appropriate real-time periodic task model for scheduling acyclic CSDF graphs.- 7 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 83-92
Open AccessManaging latency in embedded streaming applications under hard-real-time scheduling
In this paper, we consider the problem of hard-real-time scheduling of embedded streaming applications, modeled using dataflow graphs, while minimizing the application latency. Recently, it has been shown that the actors in an acyclic Cyclo-Static Dataflow (CSDF) graph can be scheduled as a set of implicit-deadline periodic tasks. Such scheduling approach has been shown to yield the maximum achievable throughput for a large set of graphs, called matched I/O rates graphs. We show that scheduling the graph actors as implicit-deadline periodic tasks increases the latency significantly for a class of graphs called unbalanced graphs. To alleviate this problem, we propose a new task-set representation for the actors in which the actors are scheduled as a set of constrained-deadline periodic tasks. We prove that scheduling the actors as constrained-deadline periodic tasks delivers optimal throughput (i.e., rate) and latency for graphs with repetition vector equal to $\vec{1}$. Furthermore, we evaluate the constrained-deadline representation using a set of 19 real-life applications and show that it is capable of achieving the minimum achievable latency for more than 70% of the applications, and even if the application has a repetition vector not equal to $\vec{1}$. We show that choosing the task deadline involves a trade-off between the latency and the resources requirements. Finally, we propose a decision tree to assist the designer in choosing the appropriate real-time periodic task model for scheduling acyclic CSDF graphs. - Open Access
- 28 June 2012
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 17 (2) , 221-249
On the hard-real-time scheduling of embedded streaming applications
- 28 June 2012
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 17 (2) , 221-249
Open AccessOn the hard-real-time scheduling of embedded streaming applications
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 941-946
A methodology for automated design of hard-real-time embedded streaming systems
The increasing complexity of modern embedded streaming applications imposes new challenges on system designers nowadays. For instance, the applications evolved to the point that in many cases hard-real-time execution on multiprocessor platforms is needed in order to meet the applications' timing requirements. Moreover, in some cases, there is a need to run a set of such applications simultaneously on the same platform with support for accepting new incoming applications at run-time. Dealing with all these new challenges increases significantly the complexity of system design. However, the design time must remain acceptable. This requires the development of novel systematic and automated design methodologies driven by the aforementioned challenges. In this paper, we propose such a novel methodology for automated design of an embedded multiprocessor system, which can run multiple hard-real-time streaming applications simultaneously. Our methodology does not need the complex and time-consuming design space exploration phase, present in most of the current state-of-the art multiprocessor design frameworks. In contrast, our methodology applies very fast yet accurate schedulability analysis to determine the minimum number of processors, needed to schedule the applications, and the mapping of applications' tasks to processors. Furthermore, our methodology enables the use of hard-real-time multiprocessor scheduling theory to schedule the applications in a way that temporal isolation and a given throughput of each application are guaranteed. We evaluate an implementation of our methodology using a set of real-life streaming applications and demonstrate that it can greatly reduce the design time and effort while generating high quality hard-real-time systems.
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 941-946
A methodology for automated design of hard-real-time embedded streaming systems
The increasing complexity of modern embedded streaming applications imposes new challenges on system designers nowadays. For instance, the applications evolved to the point that in many cases hard-real-time execution on multiprocessor platforms is needed in order to meet the applications' timing requirements. Moreover, in some cases, there is a need to run a set of such applications simultaneously on the same platform with support for accepting new incoming applications at run-time. Dealing with all these new challenges increases significantly the complexity of system design. However, the design time must remain acceptable. This requires the development of novel systematic and automated design methodologies driven by the aforementioned challenges. In this paper, we propose such a novel methodology for automated design of an embedded multiprocessor system, which can run multiple hard-real-time streaming applications simultaneously. Our methodology does not need the complex and time-consuming design space exploration phase, present in most of the current state-of-the art multiprocessor design frameworks. In contrast, our methodology applies very fast yet accurate schedulability analysis to determine the minimum number of processors, needed to schedule the applications, and the mapping of applications' tasks to processors. Furthermore, our methodology enables the use of hard-real-time multiprocessor scheduling theory to schedule the applications in a way that temporal isolation and a given throughput of each application are guaranteed. We evaluate an implementation of our methodology using a set of real-life streaming applications and demonstrate that it can greatly reduce the design time and effort while generating high quality hard-real-time systems.
- Open Access
- 9 October 2011
- Published by Association for Computing Machinery (ACM)
- p. 195-204
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
- 9 October 2011
- Published by Association for Computing Machinery (ACM)
- p. 195-204
Open AccessHard-real-time scheduling of data-dependent tasks in embedded streaming applications
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Investigating Distribution of Data of HTTP Traffic: An Empirical Study
Internet traffic today is dominated by that of the hypertext transfer protocol (HTTP). Understanding the statistical characteristics of the data transferred via HTTP helps better model traffic patterns. In this work, we conduct an empirical study by employing an experiment that accesses roughly 34,000 of the most popular Web sites on the Internet today and crawls their Web pages. We collect metadata information on the retrieved roughly two million objects. We determine statistics and distributions based on object sizes, occurrence of specific types, and sizes of specific types. The data of the distributions produced can be used as a template model for Web-traffic modeling in future research. We further note an intriguing result that 5.7% of HTTP traffic from Web servers to clients is due to sending spacer objects (image files representing a 1times1 white-space pixel) or to stale links referencing non-existing files. Such squander in bandwidth is not due to overhead and can be minimized by simple additions to the HTML standard and by automating the process of removing stale links
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Investigating Distribution of Data of HTTP Traffic: An Empirical Study
Internet traffic today is dominated by that of the hypertext transfer protocol (HTTP). Understanding the statistical characteristics of the data transferred via HTTP helps better model traffic patterns. In this work, we conduct an empirical study by employing an experiment that accesses roughly 34,000 of the most popular Web sites on the Internet today and crawls their Web pages. We collect metadata information on the retrieved roughly two million objects. We determine statistics and distributions based on object sizes, occurrence of specific types, and sizes of specific types. The data of the distributions produced can be used as a template model for Web-traffic modeling in future research. We further note an intriguing result that 5.7% of HTTP traffic from Web servers to clients is due to sending spacer objects (image files representing a 1times1 white-space pixel) or to stale links referencing non-existing files. Such squander in bandwidth is not due to overhead and can be minimized by simple additions to the HTML standard and by automating the process of removing stale links