Calculating Smarandache function in parallel

  • Sabin Tabirca
  • , Tatiana Tabirca
  • , Kieran Reynolds
  • , Laurence T. Yang

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

This article presents an efficient method to calculate in parallel the values of the Smarandache function S(i), i = 1, 2, ..., n. The value S(i) can be sequentially found with a complexity of i/log i. The computation has an important constraint, which is to have consecutive values computed by the same processor. This makes the dynamic scheduling methods inapplicable. The proposed solution is based on a Balanced Workload Block Scheduling method. Experiments show that the method is efficient and generates a good load balance.

Original languageEnglish
Title of host publicationProc. - ISPDC 2004
Subtitle of host publicationThird Int. Symp. on Parallel and Distributed Computer/HeteroPar '04: Third Int. Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Pages79-82
Number of pages4
DOIs
Publication statusPublished - 2004
EventProceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - Cork, Ireland
Duration: 5 Jul 20047 Jul 2004

Publication series

NameProceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Hete

Conference

ConferenceProceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Country/TerritoryIreland
CityCork
Period5/07/047/07/04

Fingerprint

Dive into the research topics of 'Calculating Smarandache function in parallel'. Together they form a unique fingerprint.

Cite this