Rashid Muhammad - Academia.edu (original) (raw)
Uploads
Papers by Rashid Muhammad
In dominating set problem, we are required to find a minimum size subset of vertices that each ve... more In dominating set problem, we are required to find a minimum size subset of vertices that each vertex is either in the dominating set or adjacent to some node in the dominating set. In this paper, we concentrate on the related problem of finding a connected dominating set of minimum size in which the graph induced by nodes in the dominating set are required to be connected. Instead of conventional spanning tree model, we used Steiner tree in unitdisk graph to connect nodes. The main contributions of this work are fully distributed Steiner tree with approximation ratio of 2 and as an application of the proposed approximation, a fully distributed algorithm for multicast backbone structure with an approximation ration of at most 10. The main advantage of the algorithm is that it simplifies the routing process to one in a smaller subnetwork.
A well-known challenge during processor design is to obtain best possible results for a typical t... more A well-known challenge during processor design is to obtain best possible results for a typical target application domain by combining flexibility and computational performance. ASIPs (Application Specific Instruction Set Processors) provide a tradeoff between generality of processor (flexibility) and its physical characteristics (computational performance and silicon area).
This paper evaluates an ASIP design methodology based on the extension of an existing instruction... more This paper evaluates an ASIP design methodology based on the extension of an existing instruction set and architecture described with LISA 2.0 language. The objective is to accelerate the ASIPs design process by using partially predefined, configurable RISC-like embedded processor cores that can be quickly tuned to given applications by means of ISE (Instruction Set Extension) techniques. A case study demonstrates the methodological approach for the JPEG algorithm.
In dominating set problem, we are required to find a minimum size subset of vertices that each ve... more In dominating set problem, we are required to find a minimum size subset of vertices that each vertex is either in the dominating set or adjacent to some node in the dominating set. In this paper, we concentrate on the related problem of finding a connected dominating set of minimum size in which the graph induced by nodes in the dominating set are required to be connected. Instead of conventional spanning tree model, we used Steiner tree in unitdisk graph to connect nodes. The main contributions of this work are fully distributed Steiner tree with approximation ratio of 2 and as an application of the proposed approximation, a fully distributed algorithm for multicast backbone structure with an approximation ration of at most 10. The main advantage of the algorithm is that it simplifies the routing process to one in a smaller subnetwork.
A well-known challenge during processor design is to obtain best possible results for a typical t... more A well-known challenge during processor design is to obtain best possible results for a typical target application domain by combining flexibility and computational performance. ASIPs (Application Specific Instruction Set Processors) provide a tradeoff between generality of processor (flexibility) and its physical characteristics (computational performance and silicon area).
This paper evaluates an ASIP design methodology based on the extension of an existing instruction... more This paper evaluates an ASIP design methodology based on the extension of an existing instruction set and architecture described with LISA 2.0 language. The objective is to accelerate the ASIPs design process by using partially predefined, configurable RISC-like embedded processor cores that can be quickly tuned to given applications by means of ISE (Instruction Set Extension) techniques. A case study demonstrates the methodological approach for the JPEG algorithm.