Mahmoud Naghibzadeh

Prof. Dr. Mahmoud Naghibzadeh

Depatrment of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, Khorāsān-e Raẕavī, Iran
+1

Research Focus & Metrics

Academic Career Length

47Years (1980-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013 in Future Generation Computer Systems
Verified
Journal Article
Closed access
SASaeid Abrishami
Saeid Abrishami
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
DEDick H.J. Epema
Dick H.J. Epema

13 December 2011 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SASaeid Abrishami
Saeid Abrishami
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
DEDick H.J. Epema
Dick H.J. Epema
Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility Grids is workflow scheduling, i.e., the problem of satisfying the QoS of the users as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Critical Paths (PCP), that tries to minimize the cost of workflow execution while meeting a user-defined deadline. The PCP algorithm has two phases: in the deadline distribution phase it recursively assigns subdeadlines to the tasks on the partial critical paths ending at previously assigned tasks, and in the planning phase it assigns the cheapest service to each task while meeting its subdeadline. The simulation results show that the performance of the PCP algorithm is very promising.

1 September 2007
Verified
Conference Paper
Closed access
KEKobra Etminani
Kobra Etminani
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
Today, the high cost of supercomputers in the one hand and the need for large-scale computational resources on the other hand, has led to use network of computational resources known as Grid. Numerous research groups in universities, research labs, and industries around the world are now working on a type of Grid called Computational Grids that enable aggregation of distributed resources for solving large-scale data intensive problems in science, engineering, and commerce. Several institutions and universities have started research and teaching programs on Grid computing as part of their parallel and distributed computing curriculum. To better use tremendous capabilities of this distributed system, effective and efficient scheduling algorithms are needed. In this paper, we introduce a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and Max-Min, to use their cons and at the same time, cover their pros. It selects between the two algorithms based on standard deviation of the expected completion time of tasks on resources. We evaluate our scheduling heuristic, the Selective algorithm, within a grid simulator called GridSim. We also compared our approach to its two basic heuristics. The experimental results show that the new heuristic can lead to significant performance gain for a variety of scenarios.

1 June 2012 in Scientia Iranica
Verified
Journal Article
Closed access
SASaeid Abrishami
Saeid Abrishami
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh

1 January 2009
Verified
Conference Paper
Closed access
JNJalal A. Nasiri
Jalal A. Nasiri
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
HYH. Sadoghi Yazdi
H. Sadoghi Yazdi
BNBahram Naghibzadeh
Bahram Naghibzadeh
This research is on presenting a new approach for cardiac arrhythmia disease classification. The proposed method combines both support vector machine (SVM) and genetic algorithm approaches. First, twenty two features from electrocardiogram signal are extracted. These features are obtained semiautomatically from time-voltage of R, S, T, P, Q features of an Electro Cardiagram signals. Genetic algorithm is used to improve the generalization performance of the SVM classifier. In order to do this, the design of the SVM classifier is optimized by searching for the best value of the parameters that tune its discriminate function, and looking for the best subset of features that optimizes the classification fitness function. Experimental results demonstrate that the approach adopted better classifies ECG signals. Four types of arrhythmias were distinguished with 93% accuracy.

28 September 2017 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
PNPeyman Neamatollahi
Peyman Neamatollahi
SASaeid Abrishami
Saeid Abrishami
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
MMMohammad Hossein Yaghmaee Moghaddam
Mohammad Hossein Yaghmaee Moghaddam
OYOssama Younis
Ossama Younis
Organizing sensor nodes into a clustered architecture is an effective method for load balancing and prolonging the network lifetime. However, a serious drawback of the clustering approach is the imposed energy overhead caused by the "global" clustering operations in every round of the Global Round-Based Policy (GRBP). To mitigate this problem, this work proposes a Hierarchical Clustering-task Scheduling Policy (HCSP), which triggers node-driven clustering as opposed to GRBP's time-driven clustering. Based on HCSP, each cluster is reconfigured only once at each local super round. Therefore, the cluster reconfiguration frequency varies on-demand. However, in order to refresh the entire network structure, global clustering is performed at the end of every global hyper round. Accordingly, HCSP aims to achieve a more flexible, energy-efficient, and scalable clustering-task scheduling than that of GRBP. Energy consumption calculations and extensive simulations show the effectiveness of HCSP in saving energy, and thus in prolonging the network lifetime.