Research Article
BibTex RIS Cite

Küme Bilgisayarlara Görev Ataması

Year 2019, Volume: 12 Issue: 1, 1 - 8, 01.06.2019

Mustafa Haluk Akgündüz Eşref Adalı

Abstract

Günümüzde
başarımı yeterli sayılabilecek düşük maliyetli atanmış bilgisayarlar değişik
alanlarda kullanılmaktadır. Bu makalede, bu tür atanmış bilgisayarların küme
yapısında kullanılmalarına yönelik bir çalışmanın sonuçları anlatılmıştır.



Çok
sayıda işlem gerektiren uygulamalarda bazı işlemler yinelenmektedir; bazı
işlemlerin art arda yapılması gerekir; bazı işlemler de koşut biçimde
gerçekleştirilebilir. İşlemlerin süresi değişken olabilir. Koşut işlemler aynı
anda gerçekleştirilebilirler. Tek kısıt kümedeki bilgisayar sayısıdır. Art arda
yapılması gereken işlemler, doğası gereği birbirini beklerler.



Bu
makalede, yukarıda belirtilen koşullarda, işleri küme içindeki bilgisayarlara
dağıtacak yeni bir algoritma tanıtılacak ve uygulama örnekleri sunulacaktır. 

Keywords

Atanmış bilgisayarlar Küme bilgisayarlar Dağıtık sistemler

References

  • [1]. History of Processor Performance, http://www.cs.columbia.edu/~%20sedwards/classes/20 12/3827-spring/advanced-arch-2011.pdf
  • [2]. M.H. AKGUNDUZ, E. ADALI,Atanmış Sistemler ile Bilgisayar Kümesi Tasarımı ve Mevcut Sistemler ile Karşılaştırması. TBV, Bilgisayar Bilimleri ve Mühendisliği Dergisi, Sayı:8.2, 2015
  • [3]. J.A. BANNISTER, K.S. TRIVEDI, Task Allocationin Fault-Tolerant Distributed Systems.ActaInformatica, Vol:20, 1983
  • [4]. S. HARIRI, C. S. RAGHAVENDRA, Distributed Functions Allocation for Reliability and Delay Optimization, ACM '86 Proceedings of 1986 ACM Fall joint computer conference, 1986
  • [5]. S.M. SHATZ, J. WANG, M. GOTO,TaskAllocation for Maximizing Reliability of Distributed Computer Systems IEEE Transactions on Computers Volume 41 Issue 9, September 1992
  • [6]. S. KARTIK, C.S.R. MURTHY, Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems, IEEE Transactions on Computers Volume 46 Issue 6, 1997
  • [7]. E. ADALI, Dağıtılmış Bilgisayarlarla Denetim Doçentlik Tezi, İSTANBUL, TR. 1980
  • [8]. P.R. MA, E.Y.S. LEE,M. TSUCHIYA, A TaskAllocation Model for Distributed Computing Systems,IEEE Transactions on Computers Volume 31 Issue 1, 1982
  • [9]. A.KHANDELWAL, Optimal Execution Cost of Distributed System through Clustering, International Journal of EngineeringS cience and Technology, Vol: 3, issue: 3, 2011.
  • [10]. YOUNES, Task Allocation forMinimizing Cost of Distributed Computing Systems Using Genetic Algorithms, International Journal of Advanced Research in Computer Science and Software Engineering, vol: 2, issue: 9, 2012
  • [11]. L.Rudolph,M.S. Allalouf, E.Upfal, A Simple Load Balancing Scheme for Task Allocationin Parallel Machines, SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, 1991
  • [12]. G. PFISTER, Cluster Computing, Encyclopedia of ComputerScience, John WileyandSons Ltd., ChichesterUK, 2000
  • [13]. A.B. KAHN, TopologicalSortingof Large Networks, Communications of the ACM, 5 (11), 1962
  • [14]. U. A. ACAR, A. CHARGUÉRAUD, M. RAINEY, A Work-EfficientAlgorithmforParallelUnordered Depth- First Search, SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Austin, TX, 2015
  • [15]. C. E. LEISERSON, T. B. SCHARDL. A Work-Efficient Parallel Breadth-First Search Algorithm,SPAA ’10, ACM,New York, NY, USA, 2010
  • [16]. G. E. BLELLOCH, J. T. FINEMAN, P. B. GIBBONS, J. SHUN.Internally deterministic can be fast. PPoPP ’12,ACM, New York, NY, USA, 2012
  • [17]. J. SHUN and G. E. BLELLOCH. Ligra: A Lightweight Graph Processing Framework For Shared Memory, PPOPP ’13,ACM, New York, NY, USA, 2013

Year 2019, Volume: 12 Issue: 1, 1 - 8, 01.06.2019

Mustafa Haluk Akgündüz Eşref Adalı

Abstract

References

  • [1]. History of Processor Performance, http://www.cs.columbia.edu/~%20sedwards/classes/20 12/3827-spring/advanced-arch-2011.pdf
  • [2]. M.H. AKGUNDUZ, E. ADALI,Atanmış Sistemler ile Bilgisayar Kümesi Tasarımı ve Mevcut Sistemler ile Karşılaştırması. TBV, Bilgisayar Bilimleri ve Mühendisliği Dergisi, Sayı:8.2, 2015
  • [3]. J.A. BANNISTER, K.S. TRIVEDI, Task Allocationin Fault-Tolerant Distributed Systems.ActaInformatica, Vol:20, 1983
  • [4]. S. HARIRI, C. S. RAGHAVENDRA, Distributed Functions Allocation for Reliability and Delay Optimization, ACM '86 Proceedings of 1986 ACM Fall joint computer conference, 1986
  • [5]. S.M. SHATZ, J. WANG, M. GOTO,TaskAllocation for Maximizing Reliability of Distributed Computer Systems IEEE Transactions on Computers Volume 41 Issue 9, September 1992
  • [6]. S. KARTIK, C.S.R. MURTHY, Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems, IEEE Transactions on Computers Volume 46 Issue 6, 1997
  • [7]. E. ADALI, Dağıtılmış Bilgisayarlarla Denetim Doçentlik Tezi, İSTANBUL, TR. 1980
  • [8]. P.R. MA, E.Y.S. LEE,M. TSUCHIYA, A TaskAllocation Model for Distributed Computing Systems,IEEE Transactions on Computers Volume 31 Issue 1, 1982
  • [9]. A.KHANDELWAL, Optimal Execution Cost of Distributed System through Clustering, International Journal of EngineeringS cience and Technology, Vol: 3, issue: 3, 2011.
  • [10]. YOUNES, Task Allocation forMinimizing Cost of Distributed Computing Systems Using Genetic Algorithms, International Journal of Advanced Research in Computer Science and Software Engineering, vol: 2, issue: 9, 2012
  • [11]. L.Rudolph,M.S. Allalouf, E.Upfal, A Simple Load Balancing Scheme for Task Allocationin Parallel Machines, SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, 1991
  • [12]. G. PFISTER, Cluster Computing, Encyclopedia of ComputerScience, John WileyandSons Ltd., ChichesterUK, 2000
  • [13]. A.B. KAHN, TopologicalSortingof Large Networks, Communications of the ACM, 5 (11), 1962
  • [14]. U. A. ACAR, A. CHARGUÉRAUD, M. RAINEY, A Work-EfficientAlgorithmforParallelUnordered Depth- First Search, SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Austin, TX, 2015
  • [15]. C. E. LEISERSON, T. B. SCHARDL. A Work-Efficient Parallel Breadth-First Search Algorithm,SPAA ’10, ACM,New York, NY, USA, 2010
  • [16]. G. E. BLELLOCH, J. T. FINEMAN, P. B. GIBBONS, J. SHUN.Internally deterministic can be fast. PPoPP ’12,ACM, New York, NY, USA, 2012
  • [17]. J. SHUN and G. E. BLELLOCH. Ligra: A Lightweight Graph Processing Framework For Shared Memory, PPOPP ’13,ACM, New York, NY, USA, 2013
There are 17 citations in total.

Details

Primary Language Turkish
Journal Section Makaleler(Araştırma)
Authors

Mustafa Haluk Akgündüz

Eşref Adalı

Publication Date June 1, 2019
Published in Issue Year 2019 Volume: 12 Issue: 1

Cite

APA Akgündüz, M. H., & Adalı, E. (2019). Küme Bilgisayarlara Görev Ataması. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi, 12(1), 1-8.
AMA Akgündüz MH, Adalı E. Küme Bilgisayarlara Görev Ataması. TBV-BBMD. June 2019;12(1):1-8.
Chicago Akgündüz, Mustafa Haluk, and Eşref Adalı. “Küme Bilgisayarlara Görev Ataması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi 12, no. 1 (June 2019): 1-8.
EndNote Akgündüz MH, Adalı E (June 1, 2019) Küme Bilgisayarlara Görev Ataması. Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi 12 1 1–8.
IEEE M. H. Akgündüz and E. Adalı, “Küme Bilgisayarlara Görev Ataması”, TBV-BBMD, vol. 12, no. 1, pp. 1–8, 2019.
ISNAD Akgündüz, Mustafa Haluk - Adalı, Eşref. “Küme Bilgisayarlara Görev Ataması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi 12/1 (June 2019), 1-8.
JAMA Akgündüz MH, Adalı E. Küme Bilgisayarlara Görev Ataması. TBV-BBMD. 2019;12:1–8.
MLA Akgündüz, Mustafa Haluk and Eşref Adalı. “Küme Bilgisayarlara Görev Ataması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi, vol. 12, no. 1, 2019, pp. 1-8.
Vancouver Akgündüz MH, Adalı E. Küme Bilgisayarlara Görev Ataması. TBV-BBMD. 2019;12(1):1-8.
 Download Cover Image

Article Acceptance

Use user registration/login to upload articles online.

The acceptance process of the articles sent to the journal consists of the following stages:

1. Each submitted article is sent to at least two referees at the first stage.

2. Referee appointments are made by the journal editors. There are approximately 200 referees in the referee pool of the journal and these referees are classified according to their areas of interest. Each referee is sent an article on the subject he is interested in. The selection of the arbitrator is done in a way that does not cause any conflict of interest.

3. In the articles sent to the referees, the names of the authors are closed.

4. Referees are explained how to evaluate an article and are asked to fill in the evaluation form shown below.

5. The articles in which two referees give positive opinion are subjected to similarity review by the editors. The similarity in the articles is expected to be less than 25%.

6. A paper that has passed all stages is reviewed by the editor in terms of language and presentation, and necessary corrections and improvements are made. If necessary, the authors are notified of the situation.

0

.   This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.