scispace - formally typeset
Search or ask a question
Author

Ahmad M. Shafiee

Bio: Ahmad M. Shafiee is an academic researcher from Islamic Azad University. The author has contributed to research in topics: Pipeline (computing) & Profiling (information science). The author has an hindex of 2, co-authored 5 publications receiving 17 citations. Previous affiliations of Ahmad M. Shafiee include Islamic Azad University, Isfahan.

Papers
More filters
Journal Article
TL;DR: This paper has developed the new algorithm named Intermittent X, Y (IX/Y) in simulation environment to compare delay and power consumption with elders' algorithms.
Abstract: Every day human life experiences new equipments more automatic and with more abilities. So the need for faster processors doesn’t seem to finish. Despite new architectures and higher frequencies, a single processor is not adequate for many applications. Parallel processing and networks are previous solutions for this problem. The new solution to put a network of resources on a chip is called NOC (network on a chip). The more usual topology for NOC is mesh topology. There are several routing algorithms suitable for this topology such as XY, fully adaptive, etc. In this paper we have suggested a new algorithm named Intermittent X, Y (IX/Y). We have developed the new algorithm in simulation environment to compare delay and power consumption with elders' algorithms. Keywords—Computer architecture, parallel computing, NOC, routing algorithm.

13 citations

Journal ArticleDOI
TL;DR: As the dairy products have a short consumption period, the accurate prediction of their demand is very important for the dairy industry and this research specifically addresses the prediction of demand for dairy products in the coming years.
Abstract: As the dairy products have a short consumption period, the accurate prediction of their demand is very important for the dairy industry. Accordingly, this research specifically addresses the predic...

8 citations

Proceedings ArticleDOI
13 Jun 2010
TL;DR: The R2NOC's algorithm of routing in two ways is developed, one of them is finding the shortest way between source and destination (θ algorithm) and as the second improvement, when there is congestion or a link is broken, the CR (Congestion Resistant) algorithm will find another way to send the packet.
Abstract: Ring Road NoC (R2NoC), which was motivated by smooth flow of traffic in interconnected ring roads, is the base for this paper. Router design and routing algorithm for R2NoC is much simpler. In this paper we have developed the R2NOC's algorithm of routing in two ways. One of them is finding the shortest way between source and destination (θ algorithm) and as the second improvement, when we have a congestion or a link is broken, the CR (Congestion Resistant) algorithm will find another way to send the packet and we maintain that this way is shortest safe way and because of that, our algorithm is congestion resistant.

1 citations

Proceedings ArticleDOI
19 Apr 2010
TL;DR: The proposed renaming scheme in this paper provides the advantages of banking the virtual and physical registers and adding two pointers to eliminate the need of any map table as well as free lists for physical and virtual registers.
Abstract: The number of physical registers is one of the critical issues of current superscalar out-of-order processors. A system and method for register renaming which allocates physical registers when instructions complete execution is renaming with virtual registers. In this way register pressure is significantly reduced. This method needs two map tables (GMT and PMT) which may be delayed due to the necessity of looking them up. The proposed renaming scheme in this paper provides the advantages of banking the virtual and physical registers and adding two pointers to eliminate the need of any map table as well as free lists for physical and virtual registers.

1 citations

Proceedings ArticleDOI
15 Jun 2020
TL;DR: This research tries to identify the monitoring factors and suggests a novel observation solution to create high-performance sensors to generate the user security profile for a home user concerning the user’s privacy.
Abstract: Recognising user’s risky behaviours in real-time is an important element of providing appropriate solutions and recommending suitable actions for responding to cybersecurity threats. Employing user modelling and machine learning can make this process automated by requires high-performance intelligent agent to create the user security profile. User profiling is the process of producing a profile of the user from historical information and past details. This research tries to identify the monitoring factors and suggests a novel observation solution to create high-performance sensors to generate the user security profile for a home user concerning the user’s privacy. This observer agent helps to create a decision-making model that influences the user’s decision following real-time threats or risky behaviours.

Cited by
More filters
Journal ArticleDOI
TL;DR: It is shown that it is hard to satisfy the four objectives at the same time with classical methods, highlighting the strengths of multi-objectives approaches.

48 citations

Journal ArticleDOI
TL;DR: LFA and RDA are developed based on utilizing topology-agnostic XY-YX routing algorithm as a base, along with an appropriate adoption of routing turn rules, to address said HSF CN challenges that deviate from traditional fault tolerant routing algorithms seen in NoCs.

19 citations

Journal ArticleDOI
Zheng Wang1, Huaxi Gu1, Yintang Yang1, Haibo Zhang2, Yawen Chen2 
TL;DR: A novel multicast routing algorithm based on partition is proposed to reduce the latency of multicast packets, by finding multiple routing paths and adaptively choosing available output ports based on the size of buffer space in downstream routers.

14 citations

Journal ArticleDOI
TL;DR: The experiments show that the NoC router architecture detects single-source DoS attacks and determines, with high precision, the location and direction of the collision, while incurring a low area and power overhead.
Abstract: Denial of Service (DoS) attacks are an increasing threat for Multiprocessor System-on-Chip (MPSoC) architectures. By exploiting the shared resources on the chip, an attacker is able to prevent completion or degrade the performance of a task. This is extremely dangerous for MPSoCs used in critical applications. The Network-on-Chip (NoC), as a central MPSoC infrastructure, is exposed to this attack. In order to maintain communication availability, NoCs should be enhanced with an effective and precise attack detection mechanism that allows the triggering of effective attack mitigation mechanisms. Previous research works demonstrate DoS attacks on NoCs and propose detection methods being implemented in NoC routers. These countermeasures typically led to a significantly increased router complexity and to a high degradation of the MPSoC’s performance. To this end, we present two contributions. First, we provide an analysis of information that helps to narrow down the location of the attacker in the MPSoC, achieving up to a 69% search space reduction for locating the attacker. Second, we propose a low cost mechanism for detecting the location and direction of the interference, by enhancing the communication packet structure and placing communication degradation monitors in the NoC routers. Our experiments show that our NoC router architecture detects single-source DoS attacks and determines, with high precision, the location and direction of the collision, while incurring a low area and power overhead.

12 citations

Patent
03 Feb 2012
TL;DR: In this paper, an apparatus comprising a chip comprising a plurality of nodes, a first plurality of links connecting the node in a first ring network having a first topology, and a second plurality of link connecting node in second ring network with a second topology is presented.
Abstract: An apparatus comprising a chip comprising a plurality of nodes, a first plurality of links connecting the plurality of nodes in a first ring network having a first topology, and a second plurality of links connecting the plurality of nodes in a second ring network having a second topology, wherein the first topology is different than the second topology.

10 citations