Most Beautiful Arab Girls
شركت كنندگان ملكه زيبايي فلسطين
Popular posts from this blog
FARSHID FARHAT ‘s Resume
FARSHID FARHAT 's Resume (page1/2)
Contact Information
Name: Farshid Farhat Gender: Male
Date of Birth: Sep, 10th, 1982 Office Phone: +982166165980
Email: farhat AT ee.sharif.edu Homepage: http://ee.sharif.edu/~farhat
Education
MSC, Electrical Engineering, Communications, Sharif University of Technology, Tehran, Iran, 2007, GPA: 17.7/20.
BSC, Electrical Engineering, Electronics, Sharif University of Technology, Tehran, Iran, 2005, GPA: 17/20.
Awards
Developing Simulator for MANET environment to implement some routing protocols, Booked as an invention, 2010.
Ranked Top %1 in the Nationwide University of Iran Entrance Exam for M.SC., 2005.
Ranked Top %1 in the Nationwide University of Iran Entrance Exam for B.SC., 2000.
Research Interests
Game-theoretic Approach in Networking
Information Theoretic Approach in Signal Processing
Wireless Mobile Distributed Networks
Multipath Routing Ad hoc/Sensor Protocols
3G/4G Communication Networks
Publications
D. Z. Tootaghaj, F. Farhat, M…
Contact Information
Name: Farshid Farhat Gender: Male
Date of Birth: Sep, 10th, 1982 Office Phone: +982166165980
Email: farhat AT ee.sharif.edu Homepage: http://ee.sharif.edu/~farhat
Education
MSC, Electrical Engineering, Communications, Sharif University of Technology, Tehran, Iran, 2007, GPA: 17.7/20.
BSC, Electrical Engineering, Electronics, Sharif University of Technology, Tehran, Iran, 2005, GPA: 17/20.
Awards
Developing Simulator for MANET environment to implement some routing protocols, Booked as an invention, 2010.
Ranked Top %1 in the Nationwide University of Iran Entrance Exam for M.SC., 2005.
Ranked Top %1 in the Nationwide University of Iran Entrance Exam for B.SC., 2000.
Research Interests
Game-theoretic Approach in Networking
Information Theoretic Approach in Signal Processing
Wireless Mobile Distributed Networks
Multipath Routing Ad hoc/Sensor Protocols
3G/4G Communication Networks
Publications
D. Z. Tootaghaj, F. Farhat, M…
FORK-JOIN QUEUE MODELING AND OPTIMAL SCHEDULING IN PARALLEL PROGRAMMING FRAMEWORKS
FORK-JOIN QUEUE MODELING AND OPTIMAL SCHEDULING IN PARALLEL PROGRAMMING FRAMEWORKS ABSTRACT
MapReduce framework is widely used to parallelize batch jobs since it exploits a high degree of multi-tasking to process them. However, it has been observed that when the number of servers increases, the map phase can take much longer than expected. This thesis analytically shows that the stochastic behavior of the servers has a negative effect on the completion time of a MapReduce job, and continuously increasing the number of servers without accurate scheduling can degrade the overall performance. We analytically model the map phase in terms of hardware, system, and application parameters to capture the effects of stragglers on the performance. Mean sojourn time (MST), the time needed to sync the completed tasks at a reducer, is introduced as a performance metric and mathematically formulated. Following that, we stochastically investigate the optimal task scheduling which leads to an equilibri…
Comments