جسرٌ نحو المعرفة
Skip Navigation Links الرئيسية : التفاصيل
             
الإسم : د. أحمد عواد

الرتبة العلمية: أستاذ مشارك

المسمى الوظيفي: عضو هيئة تدريسية

المكتب 7302       الرقم الفرعي 7302

بريد الكتروني: awwad@uop.edu.jo

التخصص: علم

جامعة التخرج: University of Glasgow

المؤهل العلمي

    المؤهل العلمي

    الجامعة

    البلد

    سنة الحصول على المؤهل

    البكالوريوس
    جامعة تنسي الحكومية
    الولايات المتحدة الامريكية
    1987
    الماجستير
    Tenneessee State University
    الولايات المتحدة الامريكية
    1990
    الدكتوراه
    University of Glasgow
    المملكه المتحدة
    2001



  • Journal Paper





      A. Al-Ayyoub, A. M. , " A. Al-Ayyoub · A. Awwad · K. Day · M. Ould-Khaoua, Generalized Methods for Algorithm Development on Optical Systems, Journal of Supercomputing, Vol. 38, No. 2, 2006, pp. 111-125. " , "",Vol.,No., , , 05/16/2006 :الملخص



      .M. Awwad, J. Al-Sad, " A.M. Awwad, J. Al-Sadi, On the Routing of the OTIS-Cube Network in Presence of Faults, International Arab Journal of Information Technology, Vol. 2, No. 1, 2005, pp. 17-23. " , "",Vol.,No., , , 08/12/2005 :الملخص



      A. M. Awwad, " A. M. Awwad, OTIS-Star an Attractive Alternative Network WSEAS Transaction on Information Science & Applications Issue 2, Volume 2, February 2005. pp. 245 -250. " , "",Vol.,No., , , 05/11/2005 :الملخص



      Jehad Al-Sadi and Ah, " Jehad Al-Sadi1 and Ahmad Awwad, “New OTIS-Arrangement Interconnection Network”, the International Arab Journal of Information Technology, Vol. 8, No. 4, October 2011. pp 376-381 " , "",Vol.,No., , , 08/10/2009



      Bassam Haddad and Aw, " Bassam Haddad and Awwad AhmadRepresenting Uncertainty in Medical Knowledge: An Interval-Based Approach for Binary Fuzzy Relations, The International Arab Journal of Information Technology, Vol. 7, No. 1, . pp 63-69. " , "",Vol.,No., , , 01/17/2010



      Jehad AL-Sadi, A. M., " Jehad AL-Sadi, A. M. Awwad, A new Fault-Tolerant Routing Algorithm for OTIS-Cube Using Unsafety Vectors, International Journal of Computers and Applications, Volume 27/ Number 4, pp 244 - 251. " , "",Vol.,No., , , 08/07/2005



      Awwad, A., Al-Sadi, , " Awwad, A., Al-Sadi, J., Haddad, B., & Kayed, A., Structural Outlooks for the OTIS-Arrangement Network. International Journal of Grid and High Performance Computing (IJGHPC), Vol.3 (issue 2), 2011, pp. 59-68. " , "",Vol.3,No.2, , , 11/02/2011 :الملخص
      Many recent studies have revealed that the Optical Transpose Interconnection Systems (OTIS) are promising candidates for future high-performance parallel computers. In this paper, we present and evaluate a general method for algorithm development on the OTIS-Arrangement network (OTIS-AN) as an example of OTIS network. The proposed method could be used and customized for any other OTIS network. Furthermore it allows efficient mapping of a wide class of algorithms into the OTIS-AN. This method is based on grids and pipeline as popular structures that support a vast body of parallel applications including linear algebra, divide-and-conquer type of algorithms, sorting, and FFT computation. This study confirms the viability of the OTIS-AN as an attractive alternative for large-scale parallel architectures. Download




      A. M. Awwad, A. Al-A, " A. M. Awwad, A. Al-Ayyoub, and M. Ould-Khaoua, “On the Topological Properties of the Arrangement-star Network,” Journal of Systems Architecture, Vol. 48/11-12, 2003, pp 325 – 336. " , "Journal of Systems Architecture ",Vol.Vol. 48,No.11-12, , , 01/01/2003 :الملخص
      This paper proposes a new interconnection network, referred to as the arrangement?star network, which is constructed from the product of the star and arrangement networks. Studying this new network is motivated by the good qualities it exhibits over its constituent networks, the star and arrangement networks. The star network has been a research focus for quite a long time until recently when the algorithm development on the star network turned out to be cumbersome. The arrangement network as a generalized class for the star network offers no solution in that direction. The arrangement?star network, on the other hand, makes it possible to efficiently embed grids, pipelines, as well as other computationally important topologies in a very natural manner. Furthermore, the fact that the product of the star and arrangement networks comes with little increase in the network diameter and a better result on communication cost, motivates further investigation for this new alternative, the arrangement?star network.  2003 Elsevier Science B.V. All rights reserved. Keywords: Star network; Arrangement network; Product network; Hierarchical structure; Vertex symmetry; Parallel algorithms Download




      :الملخص
      All over the world renewable energy implementations and applications are becoming a very crucial issue to their successful. Taking in consideration that a specific piece of information, service feedback, or product from an electronic provider is trustable and reliable may be a difficult task sometim


  • Conference paper





      Ahmad Awwad and Jeha, " Ahmad Awwad and Jehad Al-Sadi, OTIS-Arrangement a New Proposed Efficient Network, The International Arab Conference on Information Technology (ACIT,2008 - Dec), Tunis, 2008, pp. 95-101. " , "",Vol.,No., , , 12/16/2008 :الملخص



      J. AL-Sadi, A. M. Aw, " J. AL-Sadi, A. M. Awwad, Efficient Fault-Tolerant Routing Algorithm for OTIS-Cube Using Unsafety Vectors, Proce. Of ACM Symposium on Applied Computing (SAC04), Nicosia, Cyprus, Mar 14-17, 2004, pp.1426-1430 " , "ACM Symposium on Applied Computing (SAC04)",Vol.,No., , Nicosia, Cyprus, 03/14/2004 :الملخص
      For the first time this paper proposes a new fault-tolerant routing algorithm for the well known class of network, OTIS-cube. In this new proposed algorithm, each node A starts by computing the first level unsafety set, S1A , composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets A Sk for all 1 �� k �� m, where m is an adjustable parameter between 1 and 2n+1. Equipped with these unsafety sets we show how each node calculates numeric unsafety vectors and uses them to achieve efficient fault-tolerant routing. The paper presents also a performance analysis through extensive simulation experiments proving the superiority of the proposed algorithm using the set of unsafety vectors by showing how the destination is reached by using these sets of unsafety vectors. The simulation results are obtained in terms of routing distances and percentage of reachability. Download




      A. M. Awwad, A. Al-A, " A. M. Awwad, A. Al-Ayyoub, and M. Ould-Khaoua, Efficient Routing Algorithm on the OTIS–Networks, Proceedings of the 3rd International Conference on Information Technology ( ACIT’2002); The University of Qatar- Doha; Dec. 16-19,pp. 138-144. " , "International Conference on Information Technology ( ACIT?2002);",Vol.,No., , Doha - Qatar, 12/16/2002



      Ahmad Awwad, Bassam , " Efficient Grid on the OTIS-Arrangement Network 2010, Volume 6082 " , "Algorithms and Architectures for Parallel Processing - (ICA3PP2010)",Vol.,No., Lecture Notes in Computer Science,, Busan, 05/10/2010 :الملخص
      A number of recent studies have revealed that the Optical Transpose Interconnection Systems (or OTIS) are promising candidates for future high-performance parallel computers. In this paper, we present and two general methods for algorithm development on the OTIS. The proposed methods are general in the sense that no specific factor network or problem domain is assumed. The proposed methods allow efficient mapping of a wide class of algorithms into the OTIS. These methods are based on grids and pipelines as popular structures that support a vast body of parallel applications including linear algebra, divide-and-conquer type of algorithms, sorting, and FFT computation. This study confirms the viability of the OTIS as an attractive alternative for large-scale parallel architectures




      Ahmad Awwad, Jehad A, " Extended OTIS-Arrangement A New Efficient Interconnection Network – Proceeding of the , May 16-18, Thailand - Bangok, PP. 394-399 " , "Second International Conference on Digital Information and Communication Technology and its Applications (DICTAP2012), ",Vol.,No., , Bangkok, Thailand, 05/16/2012 :الملخص
      Abstract— in this paper, we propose a new attractive interconnection network called Extended OTIS-Arrangement network which is constructed from the cross product of the factor Arrangement network. This paper utilizes the features of Optical Transpose Interconnection Systems (OTIS) networks which use both of electronic and optical technologies. The network overcomes the weak point of some restrictions found in the known OTIS-Arrangement Network such as the degree and the diameter. This paper investigates the topological properties of the new interconnection network by presenting some attractive topological properties of the Extended OTIS-Arrangement interconnection network. The paper also presents a comparative analysis proving the superiority of the proposed network over the factor OTIS-Arrangement network. The comparison is obtained in terms of topological properties of diameter, node degree, with a low percentage of extra links. Download




      Ahmad Awwad, " Hamiltonian Cycle within Extended OTIS-Arrangement Network] TAEECE2013. sdiwc.net/conferences/2013/taeece2013/ - Turkey – Konya – May 9 -11, 2013. " , "TAEECE2013",Vol.,No., sdiwc.net/conferences/2013, Konya, Turkey, 10/09/2013 :الملخص
      In this paper we propose the construction of a Hamiltonian cycle in the Extended OTIS-Arrangement network. The Extended-OTIS-Arrangement network has many attractive topological properties Including regular degree, semantic structure, low diameter, and ability to embed graphs and cycles. As constructing a Hamiltonian cycle is one of the important advantages for any topology due to the importance of broadcast messages between different nodes. Throughout the paper we present an algorithm which constructs a Hamiltonian cycle in the extended OTIS-Arrangement interconnection network. Besides highlighting on the topological properties of the extended OTIS-Arrangement we have introduced detailed examples to show how a Hamiltonian cycle is constructed.




      Ahmad M. Awwad, and , " The Load Balancing Algorithm for the Star Interconnection Network " , "ICPDCS",Vol.,No., WASET, Istanbul, Turkwy, 09/28/2014 :الملخص
      Abstract—The star network is one of the promising interconnection networks for future high speed parallel computers, it is expected to be one of the future-generation networks. The star network is both edge and vertex symmetry, it was shown to have many gorgeous topological proprieties also it is owns hierarchical structure framework. Although much of the research work has been done on this promising network in literature, it still suffers from having enough algorithms for load balancing problem. In this paper we try to work on this issue by investigating and proposing an efficient algorithm for load balancing problem for the star network. The proposed algorithm is called Star Clustered Dimension Exchange Method SCDEM to be implemented on the star network. The proposed algorithm is based on the Clustered Dimension Exchange Method (CDEM). The SCDEM algorithm is shown to be efficient in redistributing the load balancing as evenly as possible among all nodes of different factor networks Download




      :الملخص
      The OTIS-Star interconnection network is one of the promising interconnection networks for future high speed distributed computing, The OTIS-Star topology consists of both edge and vertex symmetry, it has many attractive topological proprieties based on it is own hierarchical structure nature.
  • التقويم
    <آذار 2017>
    السبتالاحدالاثنينالثلاثاءالاربعاءالخميسالجمعة
    123
    45678910
    11121314151617
    18192021222324
    25262728293031