Salleh Abdullahi | Ahmadu Bello University, Zaria, Nigeria. (original) (raw)

Papers by Salleh Abdullahi

International Journal of Applied Information Systems, 2016

Bookmarks Related papers MentionsView impact

— Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance in time ... more — Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance in time sharing systems. In an ideal RR an equal quantum time is allocated to each process residing in the ready queue. A process which is assigned a CPU may run to completion if and only if its quantum time is greater than its CPU burst. Otherwise, after the process exhausted its quantum time the process must be preempted to take turn in the next round. Some major challenges in classical RR are: poor response time, unnecessary context switching and poor multiprogramming. Using Half Life Variable Quantum Time Round Robin (HLVQTRR), variable quantum time is used to eliminate those challenges. All dataset used for the evaluation are generated using normal distribution function.

Bookmarks Related papers MentionsView impact

There has been an unprecedented growth and increase in the domain unstructured/semi-structured da... more There has been an unprecedented growth and increase in the domain unstructured/semi-structured data is increasing over the years. While relational database systems remain popular and relevant, they are incapable of handling the growth level of unstructured data in the area of web applications. Conflating the benefits of a simple NoSQL storage engine with the relational databases and the unique ability of presenting query results from the duo to users at minimal costs have been a critical challenge in the research community. So far so good there has been a tremendous works such as using SQL with an extension of NQP on transformed NoSQL data which is store as SQL virtual relation, querying Apache Cassandra with SQL after altering the data structure, querying both world of relational and NoSQL and produced two results instead of single output. The TripleFetchQL system developed enables users to query relational and NoSQL databases and presents query results as if they were querying the familiar relational database alone. Furthermore, TripleFetchQL provide applications the ability of leveraging the benefits of relational and NoSQL databases at the small cost of learning the simple syntax of the TripleFetchQL system.

Bookmarks Related papers MentionsView impact

Abstract— Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance ... more Abstract— Round Robin (RR), one of the oldest CPU
scheduling algorithms has found its importance in time
sharing systems. In an ideal RR an equal quantum time is
allocated to each process residing in the ready queue. A
process which is assigned a CPU may run to completion if and
only if its quantum time is greater than its CPU burst.
Otherwise, after the process exhausted its quantum time the
process must be preempted to take turn in the next round.
Some major challenges in classical RR are: poor response
time, unnecessary context switching and poor
multiprogramming. Using Half Life Variable Quantum Time
Round Robin (HLVQTRR), variable quantum time is used to
eliminate those challenges. All dataset used for the evaluation
are generated using normal distribution function.

Bookmarks Related papers MentionsView impact

International Journal of Applied Information Systems, 2016

Bookmarks Related papers MentionsView impact

— Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance in time ... more — Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance in time sharing systems. In an ideal RR an equal quantum time is allocated to each process residing in the ready queue. A process which is assigned a CPU may run to completion if and only if its quantum time is greater than its CPU burst. Otherwise, after the process exhausted its quantum time the process must be preempted to take turn in the next round. Some major challenges in classical RR are: poor response time, unnecessary context switching and poor multiprogramming. Using Half Life Variable Quantum Time Round Robin (HLVQTRR), variable quantum time is used to eliminate those challenges. All dataset used for the evaluation are generated using normal distribution function.

Bookmarks Related papers MentionsView impact

There has been an unprecedented growth and increase in the domain unstructured/semi-structured da... more There has been an unprecedented growth and increase in the domain unstructured/semi-structured data is increasing over the years. While relational database systems remain popular and relevant, they are incapable of handling the growth level of unstructured data in the area of web applications. Conflating the benefits of a simple NoSQL storage engine with the relational databases and the unique ability of presenting query results from the duo to users at minimal costs have been a critical challenge in the research community. So far so good there has been a tremendous works such as using SQL with an extension of NQP on transformed NoSQL data which is store as SQL virtual relation, querying Apache Cassandra with SQL after altering the data structure, querying both world of relational and NoSQL and produced two results instead of single output. The TripleFetchQL system developed enables users to query relational and NoSQL databases and presents query results as if they were querying the familiar relational database alone. Furthermore, TripleFetchQL provide applications the ability of leveraging the benefits of relational and NoSQL databases at the small cost of learning the simple syntax of the TripleFetchQL system.

Bookmarks Related papers MentionsView impact

Abstract— Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance ... more Abstract— Round Robin (RR), one of the oldest CPU
scheduling algorithms has found its importance in time
sharing systems. In an ideal RR an equal quantum time is
allocated to each process residing in the ready queue. A
process which is assigned a CPU may run to completion if and
only if its quantum time is greater than its CPU burst.
Otherwise, after the process exhausted its quantum time the
process must be preempted to take turn in the next round.
Some major challenges in classical RR are: poor response
time, unnecessary context switching and poor
multiprogramming. Using Half Life Variable Quantum Time
Round Robin (HLVQTRR), variable quantum time is used to
eliminate those challenges. All dataset used for the evaluation
are generated using normal distribution function.

Bookmarks Related papers MentionsView impact