فهرس OSP

المقالات العلمية

5 نتيجة

مقال بحثي وصول مفتوح

An Efficient Parallel Gauss-Seidel Algorithm on a 3D Torus Network-on-Chip

Khaled Day, Mohammad H. Al-Towaiq · مجلة جامعة السلطان قابوس للعلوم · 2015 · 10.24200/squjs.vol20iss1pp29-38

… ements are interconnected with regular NoC topologies such as meshes and tori. In this paper we propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 3-dimensional torus NoC architecture. The proposed parallel algorithm is O(Nn2/k3) time complexity for solving a sys …

مقال بحثي وصول مفتوح

Solving the Flood Propagation Problem with Newton Algorithm on Parallel Systems

Chefi Triki · مجلة جامعة السلطان قابوس للعلوم · 2012 · 10.24200/squjs.vol17iss1pp147-156

In this paper we propose a parallel implementation for the flood propagation method Flo2DH. The model is built on a finite element spatial approximation combined with a Newton algorithm that uses a direct LU linear solver. The parallel implementation has been developed by using the standard MPI protocol and has been te …

مقال بحثي وصول مفتوح

A Note on Using Partitioning Techniques for Solving Unconstrained Optimization Problems on Parallel Systems

Mehiddin Al‐Baali, Chefi Triki · مجلة جامعة السلطان قابوس للعلوم · 2015 · 10.24200/squjs.vol20iss2pp12-18

We deal with the design of parallel algorithms by using variable partitioning techniques to solve nonlinear optimization problems. We propose an iterative solution method that is very efficient for separable functions, our scope being to discuss its performance for general functions. Experimental results on an illustra …

مقال بحثي وصول مفتوح

A Multi-Step Approach for Scheduling Tasks with Synchronization on Clusters of Computers

Bassel R. Arafeh · المجلة العُمانية للبحوث الهندسية · 2005 · 10.24200/tjer.vol2iss1pp77-89

… oach is adopted for scheduling tasks with synchronous inter-task communication. To that end, an efficient algorithm, called GLB-Synch, is introduced for mapping clusters and ordering tasks on processors. The algorithm used the information obtained during the clustering step for selecting a cluster to be mapped on the l …

مقال بحثي وصول مفتوح

Analysis of Buffer Arrangements in Low and High Dimensional Networks

Nasser Alzeidi · المجلة العُمانية للبحوث الهندسية · 2010 · 10.24200/tjer.vol7iss2pp80-90

… tworks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it into virtua …

احفظ هذا البحث واحصل على تنبيهات

تسجيل الدخول لحفظ عمليات البحث واستلام التنبيهات.

صدّر هذه النتائجيُنزّل حتى 100 نتيجة لبرنامج إدارة المراجع (Zotero وEndNote وMendeley).
خلاصة RSS لهذا البحث