2024-03-29T14:19:35Zhttps://research-repository.st-andrews.ac.uk/oai/requestoai:research-repository.st-andrews.ac.uk:10023/33412023-04-18T09:47:16Zcom_10023_196com_10023_39com_10023_28com_10023_94com_10023_879com_10023_878col_10023_197col_10023_859col_10023_98col_10023_880
On disjoint unions of finitely many copies of the free monogenic semigroup
Abughazalah, Nabilah
Ruskuc, Nik
EPSRC
University of St Andrews. School of Mathematics and Statistics
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA Mathematics
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
2013-02-07T12:34:47Z
2013-02-07T12:34:47Z
2013-08
Journal article
Abughazalah , N & Ruskuc , N 2013 , ' On disjoint unions of finitely many copies of the free monogenic semigroup ' , Semigroup Forum , vol. 87 , no. 1 , pp. 243-256 . https://doi.org/10.1007/s00233-013-9468-9
0037-1912
PURE: 43731800
PURE UUID: d41e01b6-9344-42e3-91dc-d90bbf07eea1
Scopus: 84880642170
ORCID: /0000-0003-2415-9334/work/73702028
http://hdl.handle.net/10023/3341
https://doi.org/10.1007/s00233-013-9468-9
EP/I032282/1
eng
Semigroup Forum
This is an author version of this article. The final publication will be available at www.springerlink.com
oai:research-repository.st-andrews.ac.uk:10023/88212024-03-06T00:42:38Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_48com_10023_16com_10023_309com_10023_879com_10023_878com_10023_4945col_10023_197col_10023_59col_10023_49col_10023_311col_10023_880col_10023_4946
Adult dental anxiety : recent assessment approaches and psychological management in a dental practice setting
Humphris, Gerald Michael
Spyt, James
Herbison, Alice
Kelsey, Tom
EPSRC
EPSRC
University of St Andrews. School of Medicine
University of St Andrews. WHO Collaborating Centre for International Child & Adolescent Health Policy
University of St Andrews. St Andrews Sustainability Institute
University of St Andrews. Health Psychology
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Dental anxiety
Psychometric assessment
Psychological management
Mobile phone application
QA75 Electronic computers. Computer science
R Medicine
Medicine(all)
Dentistry(all)
DAS
Dental Anxiety of patients is a common feature of the everyday experience of dental practice. This article advocates the use of regular assessment of this psychological construct to assist in patient management. Various tools, such as the Modified Dental Anxiety Scale (MDAS), are available to monitor dental anxiety that are quick to complete and easy to interpret. Patient burden is low. A new mobile phone assessment system (DENTANX) is being developed for distribution. This application and other psychological interventions are being investigated to assist patients to receive dental care routinely.
2016-05-18T12:30:04Z
2016-05-18T12:30:04Z
2016-05
Journal article
Humphris , G M , Spyt , J , Herbison , A & Kelsey , T 2016 , ' Adult dental anxiety : recent assessment approaches and psychological management in a dental practice setting ' , Dental Update , vol. 43 , no. 4 , pp. 388-394 . < http://www.dental-update.co.uk/articleMatchListArticle.asp?aKey=1532 >
0305-5000
ORCID: /0000-0002-8091-1458/work/27201530
ORCID: /0000-0002-4601-8834/work/64033841
https://hdl.handle.net/10023/8821
http://www.dental-update.co.uk/articleMatchListArticle.asp?aKey=1532
EP/H004092/1
N/A
eng
Dental Update
oai:research-repository.st-andrews.ac.uk:10023/170722024-02-15T00:46:30Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Computing maximal subsemigroups of a finite semigroup
Donoven, C. R.
Mitchell, J. D.
Wilson, W. A.
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Algorithms
Computational group theory
Computational semigroup theory
Maximal subsemigroups
QA Mathematics
Algebra and Number Theory
DAS
The third author wishes to acknowledge the support of his Carnegie Ph.D. Scholarship from the Carnegie Trust for the Universities of Scotland.
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes. Determining which of these forms arise in a given finite semigroup is difficult, and no practical mechanism for doing so appears in the literature. We present an algorithm for computing the maximal subsemigroups of a finite semigroup S given knowledge of the Green's structure of S, and the ability to determine maximal subgroups of certain subgroups of S, namely its group H-classes. In the case of a finite semigroup S represented by a generating set X, in many examples, if it is practical to compute the Green's structure of S from X, then it is also practical to find the maximal subsemigroups of S using the algorithm we present. In such examples, the time taken to determine the Green's structure of S is comparable to that taken to find the maximal subsemigroups. The generating set X for S may consist, for example, of transformations, or partial permutations, of a finite set, or of matrices over a semiring. Algorithms for computing the Green's structure of S from X include the Froidure–Pin Algorithm, and an algorithm of the second author based on the Schreier–Sims algorithm for permutation groups. The worst case complexity of these algorithms is polynomial in |S|, which for, say, transformation semigroups is exponential in the number of points on which they act. Certain aspects of the problem of finding maximal subsemigroups reduce to other well-known computational problems, such as finding all maximal cliques in a graph and computing the maximal subgroups in a group. The algorithm presented comprises two parts. One part relates to computing the maximal subsemigroups of a special class of semigroups, known as Rees 0-matrix semigroups. The other part involves a careful analysis of certain graphs associated to the semigroup S, which, roughly speaking, capture the essential information about the action of S on its J-classes.
2019-02-15T00:34:30Z
2019-02-15T00:34:30Z
2018-07-01
2019-02-15
Journal article
Donoven , C R , Mitchell , J D & Wilson , W A 2018 , ' Computing maximal subsemigroups of a finite semigroup ' , Journal of Algebra , vol. 505 , pp. 559-596 . https://doi.org/10.1016/j.jalgebra.2018.01.044
0021-8693
ArXiv: http://arxiv.org/abs/1606.05583v1
ORCID: /0000-0002-5489-1617/work/73700795
ORCID: /0000-0002-3382-9603/work/85855348
https://hdl.handle.net/10023/17072
10.1016/j.jalgebra.2018.01.044
https://arxiv.org/abs/1606.05583v4
eng
Journal of Algebra
oai:research-repository.st-andrews.ac.uk:10023/171102024-02-17T00:42:18Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Maximal subsemigroups of finite transformation and diagram monoids
East, James
Kumar, Jitender
Mitchell, James D.
Wilson, Wilf A.
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Maximal subsemigroups
Transformation semigroup
Diagram monoid
Permutation groups
Maximal subgroups
Graph
Maximal independent set
Partition monoid
QA Mathematics
T-NDAS
The first author gratefully acknowledges the support of the Glasgow Learning, Teaching, and Research Fund in partially funding his visit to the third author in July, 2014. The second author wishes to acknowledge the support of research initiation grant [0076|2016] provided by BITS Pilani, Pilani. The fourth author wishes to acknowledge the support of his Carnegie Ph.D. Scholarship from the Carnegie Trust for the Universities of Scotland.
We describe and count the maximal subsemigroups of many well-known transformation monoids, and diagram monoids, using a new unified framework that allows the treatment of several classes of monoids simultaneously. The problem of determining the maximal subsemigroups of a finite monoid of transformations has been extensively studied in the literature. To our knowledge, every existing result in the literature is a special case of the approach we present. In particular, our technique can be used to determine the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving transformations and partial permutations considered by I. Dimitrova, V. H. Fernandes, and co-authors. We only present details for the transformation monoids whose maximal subsemigroups were not previously known; and for certain diagram monoids, such as the partition, Brauer, Jones, and Motzkin monoids. The technique we present is based on a specialised version of an algorithm for determining the maximal subsemigroups of any finite semigroup, developed by the third and fourth authors, and available in the Semigroups package for GAP, an open source computer algebra system. This allows us to concisely present the descriptions of the maximal subsemigroups, and to clearly see their common features.
2019-02-21T00:33:45Z
2019-02-21T00:33:45Z
2018-06-15
2019-02-21
Journal article
East , J , Kumar , J , Mitchell , J D & Wilson , W A 2018 , ' Maximal subsemigroups of finite transformation and diagram monoids ' , Journal of Algebra , vol. 504 , pp. 176-216 . https://doi.org/10.1016/j.jalgebra.2018.01.048
0021-8693
RIS: urn:51F957BCA043BD3D49090344FAA7E948
ORCID: /0000-0002-5489-1617/work/73700794
ORCID: /0000-0002-3382-9603/work/85855347
https://hdl.handle.net/10023/17110
10.1016/j.jalgebra.2018.01.048
eng
Journal of Algebra
oai:research-repository.st-andrews.ac.uk:10023/57932023-04-18T09:45:45Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Maximal subsemigroups of the semigroup of all mappings on an infinite set
East, J.
Mitchell, James David
Péresse, Y.
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA Mathematics
T-NDAS
BDC
R2C
In this paper we classify the maximal subsemigroups of the full transformation semigroup ΩΩ, which consists of all mappings on the infinite set Ω, containing certain subgroups of the symmetric group Sym (Ω) on Ω. In 1965 Gavrilov showed that there are five maximal subsemigroups of ΩΩ containing Sym (Ω) when Ω is countable, and in 2005 Pinsker extended Gavrilov's result to sets of arbitrary cardinality. We classify the maximal subsemigroups of ΩΩ on a set Ω of arbitrary infinite cardinality containing one of the following subgroups of Sym (Ω): the pointwise stabiliser of a non-empty finite subset of Ω, the stabiliser of an ultrafilter on Ω, or the stabiliser of a partition of Ω into finitely many subsets of equal cardinality. If G is any of these subgroups, then we deduce a characterisation of the mappings f, g ∈ ΩΩ such that the semigroup generated by G ∪ {f, g} equals ΩΩ.
2014-11-19T10:01:06Z
2014-11-19T10:01:06Z
2015-03-01
Journal article
East , J , Mitchell , J D & Péresse , Y 2015 , ' Maximal subsemigroups of the semigroup of all mappings on an infinite set ' , Transactions of the American Mathematical Society , vol. 367 , no. 3 , pp. 1911-1944 . https://doi.org/10.1090/S0002-9947-2014-06110-2
0002-9947
PURE: 23107193
PURE UUID: d622aa4b-0740-4abc-883a-339349d48c2d
ArXiv: http://arxiv.org/abs/1104.2011v2
Scopus: 84916620178
ORCID: /0000-0002-5489-1617/work/73700777
WOS: 000351857000014
http://hdl.handle.net/10023/5793
https://doi.org/10.1090/S0002-9947-2014-06110-2
eng
Transactions of the American Mathematical Society
© 2014. American Mathematical Society. First published in Transactions of the American Mathematical Society 2014.
oai:research-repository.st-andrews.ac.uk:10023/23752024-03-04T00:40:53Zcom_10023_196com_10023_39com_10023_28com_10023_879com_10023_878col_10023_197col_10023_859col_10023_880
Unary FA-presentable semigroups
Cain, Alan James
Ruskuc, Nik
Thomas, R.M.
EPSRC
EPSRC
University of St Andrews. School of Mathematics and Statistics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Automatic presentations
Semigroups
Regular languages
QA Mathematics
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classication of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a dicult problem in general. A restricted problem, also of signicant interest, is to ask this question for unary automatic presentations: auto-matic presentations over a one-letter alphabet. This paper studies unary FA-presentable semigroups. We prove the following: Every unary FA-presentable structure admits an injective unary automatic presentation where the language of representatives consists of every word over a one-letter alphabet. Unary FA-presentable semigroups are locally nite, but non-nitely generated unary FA-presentable semigroups may be innite. Every unary FA-presentable semigroup satises some Burnside identity.We describe the Green's relations in unary FA-presentable semigroups. We investigate the relationship between the class of unary FA-presentable semigroups and various semigroup constructions. A classication is given of the unary FA-presentable completely simple semigroups.
2012-02-28T11:01:02Z
2012-02-28T11:01:02Z
2012-06-08
Journal article
Cain , A J , Ruskuc , N & Thomas , R M 2012 , ' Unary FA-presentable semigroups ' , International Journal of Algebra and Computation , vol. 22 , no. 4 , 1250038 . https://doi.org/10.1142/S0218196712500385
0218-1967
ORCID: /0000-0003-2415-9334/work/73702055
https://hdl.handle.net/10023/2375
10.1142/S0218196712500385
EP/C523229/1
EP/H011978/1
eng
International Journal of Algebra and Computation
oai:research-repository.st-andrews.ac.uk:10023/158942024-03-27T00:38:28Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice
Spracklen, Patrick
Akgun, Ozgur
Miguel, Ian James
Hooker, John
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA75 Electronic computers. Computer science
NDAS
BDC
Funding: EPSRC EP/P015638/1.
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.
2018-08-28T14:30:10Z
2018-08-28T14:30:10Z
2018
Conference item
Spracklen , P , Akgun , O & Miguel , I J 2018 , Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice . in J Hooker (ed.) , Principles and Practice of Constraint Programming : 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings . Lecture Notes in Computer Science (including subseries Programming and Software Engineering) , vol. 11008 LNCS , Springer , Cham , pp. 362-372 . https://doi.org/10.1007/978-3-319-98334-9_24
9783319983332
9783319983349
0302-9743
ORCID: /0000-0001-9519-938X/work/47928988
ORCID: /0000-0002-6930-2686/work/68281433
https://hdl.handle.net/10023/15894
10.1007/978-3-319-98334-9_24
eng
Principles and Practice of Constraint Programming
Lecture Notes in Computer Science (including subseries Programming and Software Engineering)
Springer
oai:research-repository.st-andrews.ac.uk:10023/21312023-04-18T09:42:52Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Generators and relations for subsemigroups via boundaries in Cayley graphs
Gray, R
Ruskuc, Nik
EPSRC
EPSRC
EPSRC
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Semigroup
Generators
Presentations
Cayley graph
Subsemigroup
Reidemeister-Schreier rewriting
QA Mathematics
Given a finitely generated semigroup S and subsemigroup T of S we define the notion of the boundary of T in S which, intuitively, describes the position of T inside the left and right Cayley graphs of S. We prove that if S is finitely generated and T has a finite boundary in S then T is finitely generated. We also prove that if S is finitely presented and T has a finite boundary in S then T is finitely presented. Several corollaries and examples are given.
2011-12-23T11:08:36Z
2011-12-23T11:08:36Z
2011-11
Journal article
Gray , R & Ruskuc , N 2011 , ' Generators and relations for subsemigroups via boundaries in Cayley graphs ' , Journal of Pure and Applied Algebra , vol. 215 , no. 11 , pp. 2761-2779 . https://doi.org/10.1016/j.jpaa.2011.03.017
0022-4049
PURE: 5158279
PURE UUID: ab2695c1-8bc5-44a7-9e4f-a46efd512876
Scopus: 79956008214
ORCID: /0000-0003-2415-9334/work/73702072
http://hdl.handle.net/10023/2131
https://doi.org/10.1016/j.jpaa.2011.03.017
EP/C523229/1
EP/E043194/1
EP/H011978/1
eng
Journal of Pure and Applied Algebra
This is an author version of this article. The definitive version (c) 2011 Elsevier B.V. is available from www.sciencedirect.com
oai:research-repository.st-andrews.ac.uk:10023/21372023-04-18T09:42:57Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Growth rates for subclasses of Av(321)
Albert, M.H.
Atkinson, M.D.
Brignall, R
Ruskuc, Nik
Smith, R
West, J
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA Mathematics
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does not change growth rates.
2011-12-23T13:08:41Z
2011-12-23T13:08:41Z
2010-10-22
Journal article
Albert , M H , Atkinson , M D , Brignall , R , Ruskuc , N , Smith , R & West , J 2010 , ' Growth rates for subclasses of Av(321) ' , Electronic Journal of Combinatorics , vol. 17 , no. 1 , R141 .
1097-1440
PURE: 5162387
PURE UUID: abfae055-4852-434d-9b3d-19bb2ab2c87d
Scopus: 78149431471
ORCID: /0000-0003-2415-9334/work/73702023
http://hdl.handle.net/10023/2137
http://www.combinatorics.org/Volume_17/v17i1toc.html
eng
Electronic Journal of Combinatorics
(c) The authors. Published in the Electronic Journal of Combinatorics at http://www.combinatorics.org/
oai:research-repository.st-andrews.ac.uk:10023/118792023-04-18T23:36:18Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_59col_10023_98col_10023_880
Two variants of the froidure-pin algorithm for finite semigroups
Jonusas, Julius
Mitchell, J. D.
Pfeiffer, M.
European Commission
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
University of St Andrews. School of Computer Science
Algorithms
Green's relations
Monoids
Semigroups
QA Mathematics
Mathematics(all)
DAS
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented here produce the left and right Cayley graphs, a confluent terminating rewriting system, and a reduced word of the rewriting system for every element of the semigroup. If U is any semigroup, and A is a subset of U, then we denote by <A> the least subsemigroup of U containing A. If B is any other subset of U, then, roughly speaking, the first algorithm we present describes how to use any information about <A>, that has been found using the Froidure-Pin Algorithm, to compute the semigroup <A∪B>. More precisely, we describe the data structure for a finite semigroup S given by Froidure and Pin, and how to obtain such a data structure for <A∪B> from that for <A>. The second algorithm is a lock-free concurrent version of the Froidure-Pin Algorithm.
2017-10-18T15:30:13Z
2017-10-18T15:30:13Z
2018-02-08
Journal article
Jonusas , J , Mitchell , J D & Pfeiffer , M 2018 , ' Two variants of the froidure-pin algorithm for finite semigroups ' , Portugaliae Mathematica , vol. 74 , no. 3 , pp. 173-200 . https://doi.org/10.4171/PM/2001
0032-5155
PURE: 249695343
PURE UUID: 3d9792a3-36ee-443b-be0d-ad884fc89944
ArXiv: http://arxiv.org/abs/1704.04084v1
Scopus: 85041706757
ORCID: /0000-0002-9881-4429/work/47356677
ORCID: /0000-0002-5489-1617/work/73700820
WOS: 000427321500002
http://hdl.handle.net/10023/11879
https://doi.org/10.4171/PM/2001
http://arxiv.org/abs/1704.04084v1
676541
eng
Portugaliae Mathematica
© 2017, Portuguese Mathematical Society. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version.
oai:research-repository.st-andrews.ac.uk:10023/151812024-02-15T00:36:57Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Using metric space indexing for complete and efficient record linkage
Akgün, Özgür
Dearle, Alan
Kirby, Graham Njal Cameron
Christen, Peter
Phung, Dinh
Tseng, Vincent S.
Webb, Geoff
Ho, Bao
Ganji, Mohadeseh
Rashidi, Lida
Economic & Social Research Council
Economic & Social Research Council
Scottish Funding Council
University of St Andrews. School of Computer Science
University of St Andrews. Office of the Principal
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Entity resolution
Data matching
Similarity search
Blocking
QA75 Electronic computers. Computer science
ZA4050 Electronic information resources
Theoretical Computer Science
Computer Science(all)
DAS
BDC
R2C
~DC~
Record linkage is the process of identifying records that refer to the same real-world entities in situations where entity identifiers are unavailable. Records are linked on the basis of similarity between common attributes, with every pair being classified as a link or non-link depending on their similarity. Linkage is usually performed in a three-step process: first, groups of similar candidate records are identified using indexing, then pairs within the same group are compared in more detail, and finally classified. Even state-of-the-art indexing techniques, such as locality sensitive hashing, have potential drawbacks. They may fail to group together some true matching records with high similarity, or they may group records with low similarity, leading to high computational overhead. We propose using metric space indexing (MSI) to perform complete linkage, resulting in a parameter-free process combining indexing, comparison and classification into a single step delivering complete and efficient record linkage. An evaluation on real-world data from several domains shows that linkage using MSI can yield better quality than current indexing techniques, with similar execution cost, without the need for domain knowledge or trial and error to configure the process.
2018-07-10T12:30:05Z
2018-07-10T12:30:05Z
2018
2018-06-17
Conference item
Akgün , Ö , Dearle , A , Kirby , G N C & Christen , P 2018 , Using metric space indexing for complete and efficient record linkage . in D Phung , V S Tseng , G Webb , B Ho , M Ganji & L Rashidi (eds) , Advances in Knowledge Discovery and Data Mining : 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, June 3-6, 2018, Proceedings, Part III . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 10939 LNCS , Springer , Cham , pp. 89-101 , 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2018) , Melbourne , Victoria , Australia , 3/06/18 . https://doi.org/10.1007/978-3-319-93040-4_8
conference
9783319930398
9783319930404
0302-9743
ORCID: /0000-0002-4422-0190/work/46569125
ORCID: /0000-0001-9519-938X/work/46569180
https://hdl.handle.net/10023/15181
10.1007/978-3-319-93040-4_8
ES/L007487/1
ES/K00574X/2
eng
Advances in Knowledge Discovery and Data Mining
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Springer
oai:research-repository.st-andrews.ac.uk:10023/58952023-04-19T00:38:26Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Repeating history : execution replay for Parallel Haskell programs
Ferrerio, Henrique
Janjic, Vladimir
Castro, Laura
Hammond, Kevin
European Commission
European Commission
EPSRC
EPSRC
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA75 Electronic computers. Computer science
Parallel profiling tools, such as ThreadScope for Parallel Haskell, allow programmers to obtain information about the performance of their parallel programs. However, the information they provide is not always sufficiently detailed to precisely pinpoint the cause of some per- formance problems. Often, this is because the cost of obtaining that information would be prohibitive for a complete program execution. In this paper, we adapt the well-known technique of execution replay to make it possible to simulate a previous run of a program. We ensure that the non-deterministic parallel behaviour of the application is prop- erly emulated while the deterministic functional code is run unmodified. In this way, we can gather additional data about the behaviour of a par- allel program by replaying some parts of it with more detailed profiling information. We exploit this ability to identify performance bottlenecks in a quicksort implementation, and to derive a version that gives better speedups on multicore machines.
2014-12-08T15:31:07Z
2014-12-08T15:31:07Z
2013
Conference item
Ferrerio , H , Janjic , V , Castro , L & Hammond , K 2013 , Repeating history : execution replay for Parallel Haskell programs . in Trends in Functional Programming : 13th International Symposium . vol. 7829 , Lecture Notes in Computer Science (LNCS) , Springer , pp. 231-246 . https://doi.org/10.1007/978-3-642-40447-4_15
9783642404467
9783642404474
PURE: 47894726
PURE UUID: 0abca1a0-4ad5-4e9f-804d-635961339fdc
Scopus: 84883202865
ORCID: /0000-0002-4326-4562/work/33080460
http://hdl.handle.net/10023/5895
https://doi.org/10.1007/978-3-642-40447-4_15
n/a
FP&-ICT-2011-7
EP/G055181/1
EP/F030657/1
eng
Trends in Functional Programming
Lecture Notes in Computer Science (LNCS)
© 2013. Springer-Verlag Berlin Heidelberg. This is an Accepted Manuscript of an article published in Lecture Notes on Computer Science, subseries Trends in Functional Programming 2013. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40447-4_15
Springer
oai:research-repository.st-andrews.ac.uk:10023/31752023-04-18T09:46:36Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Interfacing Coq + SSReflect with GAP
Komendantsky, Vladimir
Konovalov, Alexander
Linton, Stephen Alexander
European Commission
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Coq
GAP
OpenMath
Symbolic Computation Software Composability Protocol
QA76 Computer software
Presentation slides and preprint both provided by author. Preprint published in Electronic Notes in Theoretical Computer Science: Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers (UITP10).
We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composability Protocol (SCSCP). It allows Coq to issue OpenMath requests to a local or remote GAP instances and represent server responses as Coq terms.
2012-10-11T10:01:02Z
2012-10-11T10:01:02Z
2012-09-19
Journal article
Komendantsky , V , Konovalov , A & Linton , S A 2012 , ' Interfacing Coq + SSReflect with GAP ' , Electronic Notes in Theoretical Computer Science , vol. 285 , no. 19 , pp. 17-28 . https://doi.org/10.1016/j.entcs.2012.06.003
1571-0661
PURE: 28842268
PURE UUID: 67fa9624-4548-4bcb-8ca8-e67e16c05cc4
Scopus: 84866372270
http://hdl.handle.net/10023/3175
https://doi.org/10.1016/j.entcs.2012.06.003
http://www.floc-conference.org/UITP-home.html
026133
eng
Electronic Notes in Theoretical Computer Science
This is the author's preprint of an article published in Electronic Notes in Theoretical Computer Science. A definitive version (c) 2012 Elsevier B.V. is available from http://www.sciencedirect.com
oai:research-repository.st-andrews.ac.uk:10023/115432024-02-26T00:43:09Zcom_10023_92com_10023_28com_10023_196com_10023_39com_10023_879com_10023_878col_10023_96col_10023_197col_10023_859col_10023_880
Erwin Schrödinger and quantum wave mechanics
O'Connor, John J.
Robertson, Edmund F.
University of St Andrews. School of Mathematics and Statistics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
University of St Andrews. Applied Mathematics
QC Physics
T-NDAS
The fathers of matrix quantum mechanics believed that the quantum particles are unanschaulich (unvisualizable) and that quantum particles pop into existence only when we measure them. Challenging the orthodoxy, in 1926 Erwin Schrödinger developed his wave equation that describes the quantum particles as a packet of quantum probability amplitudes evolving in space and time. Thus, Schrödinger visualized the unvisualizable and lifted the veil that has been obscuring the wonders of the quantum world.
2017-08-25T11:30:08Z
2017-08-25T11:30:08Z
2017-08-22
Journal article
O'Connor , J J & Robertson , E F 2017 , ' Erwin Schrödinger and quantum wave mechanics ' , Quanta , vol. 6 , no. 1 , pp. 48-52 . https://doi.org/10.12743/quanta.v6i1.60
1314-7374
crossref: 10.12743/quanta.v6i1.60
https://hdl.handle.net/10023/11543
10.12743/quanta.v6i1.60
eng
Quanta
oai:research-repository.st-andrews.ac.uk:10023/19982023-04-18T09:42:54Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Presentations of inverse semigroups, their kernels and extensions
Carvalho, C.A.
Gray, R
Ruskuc, Nik
EPSRC
EPSRC
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Inverse semigroup presentations
Reidemeister-Schreier
Kernel
Finiteness conditions
QA Mathematics
"Part of this work was done while Gray was an EPSRC Postdoctoral Research Fellow at the University of St Andrews, Scotland"
Let S be an inverse semigroup and let π:S→T be a surjective homomorphism with kernel K. We show how to obtain a presentation for K from a presentation for S, and vice versa. We then investigate the relationship between the properties of S, K and T, focusing mainly on finiteness conditions. In particular we consider finite presentability, solubility of the word problem, residual finiteness, and the homological finiteness property FPn. Our results extend several classical results from combinatorial group theory concerning group extensions to inverse semigroups. Examples are also provided that highlight the differences with the special case of groups.
2011-09-02T14:57:54Z
2011-09-02T14:57:54Z
2011-06-01
Journal article
Carvalho , C A , Gray , R & Ruskuc , N 2011 , ' Presentations of inverse semigroups, their kernels and extensions ' , Journal of the Australian Mathematical Society , vol. 90 , no. 3 , pp. 289-316 . https://doi.org/10.1017/S1446788711001297
1446-7887
PURE: 5160166
PURE UUID: f4d51f78-f930-4cb9-b02d-1eb994b2bfa4
Scopus: 84856402640
ORCID: /0000-0003-2415-9334/work/73702058
http://hdl.handle.net/10023/1998
https://doi.org/10.1017/S1446788711001297
EP/E043194/1
EP/H011978/1
eng
Journal of the Australian Mathematical Society
This is an author version of the article. The published version copyright (c) Australian Mathematical Publishing Association Inc. 2011 is available from http://journals.cambridge.org
oai:research-repository.st-andrews.ac.uk:10023/124912023-04-19T00:42:12Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Knowledge-based interoperability for mathematical software systems
Kohlhase, Michael
De Feo, Luca
Müller, Dennis
Pfeiffer, Markus Johannes
Rabe, Florian
Thiéry, Nicolas
Vasilyev, Victor
Wiesing, Tom
Blömer, Johannes
Kotsireas, Ilias
Kutsia, Temur
Simos, Dimitris E.
European Commission
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA76 Computer software
T-NDAS
Funding: OpenDreamKit Horizon 2020 European Research Infrastructures project (#676541) and DFG project RA-18723-1 OAF.
There is a large ecosystem of mathematical software systems. Individually, these are optimized for particular domains and functionalities, and together they cover many needs of practical and theoretical mathematics. However, each system specializes on one area, and it remains very difficult to solve problems that need to involve multiple systems. Some integrations exist, but the are ad-hoc and have scalability and maintainability issues. In particular, there is not yet an interoperability layer that combines the various systems into a virtual research environment (VRE) for mathematics. The OpenDreamKit project aims at building a toolkit for such VREs. It suggests using a central system-agnostic formalization of mathematics (Math-in-the-Middle, MitM) as the needed interoperability layer. In this paper, we conduct the first major case study that instantiates the MitM paradigm for a concrete domain as well as a concrete set of systems. Specifically, we integrate GAP, Sage, and Singular to perform computation in group and ring theory. Our work involves massive practical efforts, including a novel formalization of computational group theory, improvements to the involved software systems, and a novel mediating system that sits at the center of a star-shaped integration layout between mathematical software systems.
2018-01-16T15:30:14Z
2018-01-16T15:30:14Z
2017
Conference item
Kohlhase , M , De Feo , L , Müller , D , Pfeiffer , M J , Rabe , F , Thiéry , N , Vasilyev , V & Wiesing , T 2017 , Knowledge-based interoperability for mathematical software systems . in J Blömer , I Kotsireas , T Kutsia & D E Simos (eds) , Mathematical Aspects of Computer and Information Sciences : 7th International Conference, MACIS 2017, Vienna, Austria, November 15-17, 2017, Proceedings . Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) , vol. 10693 , Springer , Cham , pp. 195-210 , 7th International Conference on Mathematical Aspects of Computer and Information Sciences , Vienna , Austria , 15/11/17 . https://doi.org/10.1007/978-3-319-72453-9_14
conference
9783319724522
9783319724539
0302-9743
PURE: 251333725
PURE UUID: 8941b405-213b-4c95-89dd-93e20d5f86ec
Scopus: 85039430221
ORCID: /0000-0002-9881-4429/work/47136373
http://hdl.handle.net/10023/12491
https://doi.org/10.1007/978-3-319-72453-9_14
676541
eng
Mathematical Aspects of Computer and Information Sciences
Lecture Notes in Computer Science (Theoretical Computer Science and General Issues)
© 2017, Springer International Publishing AG. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-319-72453-9_14
Springer
oai:research-repository.st-andrews.ac.uk:10023/99352023-01-03T11:30:13Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Timing properties and correctness for structured parallel programs on x86-64 multicores
Hammond, Kevin
Brown, Christopher Mark
Sarkar, Susmit
van Eekelen, Marko
Dal Lago, Ugo
European Commission
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Multicore
Relaxed-memory concurrency
Functional correctness
Algorithmic skeletons
Operational semantics
Timing models
QA75 Electronic computers. Computer science
QA76 Computer software
TA Engineering (General). Civil engineering (General)
DAS
This paper determines correctness and timing properties for structured parallel programs on x86-64 multicores. Multicore architectures are increasingly common, but real architectures have unpredictable timing properties, and even correctness is not obvious above the relaxed-memory concurrency models that are enforced by commonly-used hardware. This paper takes a rigorous approach to correctness and timing properties, examining common locking protocols from first principles, and extending this through queues to structured parallel constructs. We prove functional correctness and derive simple timing models, and both extend for the first time from low-level primitives to high-level parallel patterns. Our derived high-level timing models for structured parallel programs allow us to accurately predict upper bounds on program execution times on x86-64 multicores.
2016-12-05T12:30:29Z
2016-12-05T12:30:29Z
2016
2016-12-04
Conference item
Hammond , K , Brown , C M & Sarkar , S 2016 , Timing properties and correctness for structured parallel programs on x86-64 multicores . in M van Eekelen & U Dal Lago (eds) , Foundational and Practical Aspects of Resource Analysis : 4th International Workshop, FOPARA 2015, London, UK, April 11, 2015. Revised Selected Papers . Lecture Notes in Computer Science , vol. 9964 , Springer , pp. 101-125 , 4th International Workshop, Foundational and Practical Aspects of Resource Analysis (FOPARA 2015) , London , United Kingdom , 11/04/15 . https://doi.org/10.1007/978-3-319-46559-3_6
workshop
9783319465586
9783319465593
0302-9743
PURE: 248130167
PURE UUID: 6e70a1de-b0e5-44e1-a788-5ceb09100b7f
Scopus: 85007564192
ORCID: /0000-0002-4326-4562/work/33080443
ORCID: /0000-0001-6030-2885/work/70619194
ORCID: /0000-0002-4259-9213/work/125727585
http://hdl.handle.net/10023/9935
https://doi.org/10.1007/978-3-319-46559-3_6
644235
eng
Foundational and Practical Aspects of Resource Analysis
Lecture Notes in Computer Science
© 2016, Springer International Switzerland. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://doi.org/ 10.1007/978-3-319-46559-3 6
Springer
oai:research-repository.st-andrews.ac.uk:10023/19972024-03-24T00:40:25Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Simple extensions of combinatorial structures
Brignall, R
Ruskuc, Nik
Vatter, V
EPSRC
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
QA Mathematics
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a simple structure from C by adding at most f (n) elements. We prove such results when C is the class of all tournaments, graphs, permutations, posets, digraphs, oriented graphs and general relational structures containing a relation of arity greater than 2. The function f (n) in these cases is 2, ⌈log2(n + 1)⌉, ⌈(n + 1)/2⌉, ⌈(n + 1)/2⌉, ⌈log4(n + 1)⌉, ⌈log3(n + 1)⌉ and 1, respectively. In each case these bounds are the best possible.
2011-09-02T13:27:55Z
2011-09-02T13:27:55Z
2011-07
Journal article
Brignall , R , Ruskuc , N & Vatter , V 2011 , ' Simple extensions of combinatorial structures ' , Mathematika , vol. 57 , no. 2 , pp. 193-214 . https://doi.org/10.1112/S0025579310001518
0025-5793
ORCID: /0000-0003-2415-9334/work/73702074
https://hdl.handle.net/10023/1997
10.1112/S0025579310001518
GR/S53503/01
eng
Mathematika
oai:research-repository.st-andrews.ac.uk:10023/27602023-04-18T09:42:52Zcom_10023_196com_10023_39com_10023_94com_10023_28com_10023_879com_10023_878col_10023_197col_10023_98col_10023_880
Green index in semigroups : generators, presentations and automatic structures
Cain, A.J.
Gray, R
Ruskuc, Nik
EPSRC
EPSRC
University of St Andrews. Pure Mathematics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Green index
Presentations
Automatic semigroup
Finiteness conditions
QA Mathematics
The Green index of a subsemigroup T of a semigroup S is given by counting strong orbits in the complement S n T under the natural actions of T on S via right and left multiplication. This partitions the complement S nT into T-relative H -classes, in the sense of Wallace, and with each such class there is a naturally associated group called the relative Schützenberger group. If the Rees index ΙS n TΙ is finite, T also has finite Green index in S. If S is a group and T a subgroup then T has finite Green index in S if and only if it has finite group index in S. Thus Green index provides a common generalisation of Rees index and group index. We prove a rewriting theorem which shows how generating sets for S may be used to obtain generating sets for T and the Schützenberger groups, and vice versa. We also give a method for constructing a presentation for S from given presentations of T and the Schützenberger groups. These results are then used to show that several important properties are preserved when passing to finite Green index subsemigroups or extensions, including: finite generation, solubility of the word problem, growth type, automaticity (for subsemigroups), finite presentability (for extensions) and finite Malcev presentability (in the case of group-embeddable semigroups).
2012-06-13T11:31:01Z
2012-06-13T11:31:01Z
2012
Journal article
Cain , A J , Gray , R & Ruskuc , N 2012 , ' Green index in semigroups : generators, presentations and automatic structures ' , Semigroup Forum , vol. Online First . https://doi.org/10.1007/s00233-012-9406-2
0037-1912
PURE: 5158227
PURE UUID: bd48078c-8bad-484a-b52a-288031114e6a
Scopus: 84871329719
ORCID: /0000-0003-2415-9334/work/73702084
http://hdl.handle.net/10023/2760
https://doi.org/10.1007/s00233-012-9406-2
EP/H011978/1
EP/E043194/1
eng
Semigroup Forum
This is an author version of this work. The original publication (c) Springer Science+Business Media, LLC 2012 is available at www.springerlink.com
oai:research-repository.st-andrews.ac.uk:10023/168552023-04-19T00:43:25Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Proof-carrying plans
Schwaab, Christopher Joseph
Komendantskaya, Ekaterina
Hill, Alisdair
Farka, František
Petrick, Ronald
Wells, Joe
Hammond, Kevin
Alferes, Jose Julio
Johansson, Moa
European Commission
EPSRC
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
API planning
Curry-Howard correspondence
Constructive logic
Verification
Dependent types
BC Logic
QA75 Electronic computers. Computer science
T Technology
T-NDAS
It is becoming increasingly important to verify safety and security of AI applications. While declarative languages (of the kind found in automated planners and model checkers) are traditionally used for verifying AI systems, a big challenge is to design methods that generate verified executable programs. A good example of such a “verification to implementation” cycle is given by automated planning languages like PDDL, where plans are found via a model search in a declarative language, but then interpreted or compiled into executable code in an imperative language. In this paper, we show that this method can itself be verified. We present a formal framework and a prototype Agda implementation that represent PDDL plans as executable functions that inhabit types that are given by formulae describing planning problems. By exploiting the well-known Curry-Howard correspondence, type-checking then automatically ensures that the generated program corresponds precisely to the specification of the planning problem.
2019-01-14T11:30:05Z
2019-01-14T11:30:05Z
2019-01
Conference item
Schwaab , C J , Komendantskaya , E , Hill , A , Farka , F , Petrick , R , Wells , J & Hammond , K 2019 , Proof-carrying plans . in J J Alferes & M Johansson (eds) , Practical Aspects of Declarative Languages : 21st International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019, Proceedings . Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 11372 , Springer , Cham , pp. 204-220 , 21st International Symposium on Practical Aspects of Declarative Languages (PADL 2019) , Lisbon , Portugal , 14/01/19 . https://doi.org/10.1007/978-3-030-05998-9_13
conference
9783030059972
0302-9743
PURE: 256607242
PURE UUID: cfd98688-3e2a-4da7-b702-984d65624446
ORCID: /0000-0002-4326-4562/work/52572463
Scopus: 85059659950
WOS: 000704024700013
http://hdl.handle.net/10023/16855
https://doi.org/10.1007/978-3-030-05998-9_13
779882
EP/P020631/1
eng
Practical Aspects of Declarative Languages
Lecture Notes in Computer Science (Programming and Software Engineering)
© 2019, Springer Nature Switzerland AG. This work has been made available online in accordance with the publisher's policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-05998-9_13
Springer
oai:research-repository.st-andrews.ac.uk:10023/20042023-04-18T09:43:52Zcom_10023_196com_10023_39com_10023_28com_10023_879com_10023_878col_10023_197col_10023_859col_10023_880
Finite groups are big as semigroups
Dolinka, Igor
Ruskuc, Nik
EPSRC
University of St Andrews. School of Mathematics and Statistics
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Finite maximal subsemigroup
Rees matrix semigroup
QA Mathematics
We prove that a finite group G occurs as a maximal proper subsemigroup of an infinite semigroup (in the terminology of Freese, Ježek, and Nation, G is a big semigroup) if and only if |G| ≥ 3. In fact, any finite semigroup whose minimal ideal contains a subgroup with at least three elements is big.
2011-09-19T08:57:01Z
2011-09-19T08:57:01Z
2011-09
Journal article
Dolinka , I & Ruskuc , N 2011 , ' Finite groups are big as semigroups ' , Archiv der Mathematik , vol. 97 , no. 3 , pp. 209-217 . https://doi.org/10.1007/s00013-011-0297-3
0003-889X
PURE: 13162230
PURE UUID: c01ed6ed-dd50-4f06-86f1-34cff82691a1
Scopus: 80052616304
ORCID: /0000-0003-2415-9334/work/73702040
http://hdl.handle.net/10023/2004
https://doi.org/10.1007/s00013-011-0297-3
EP/H011978/1
eng
Archiv der Mathematik
This is an author version of this article. The original publication is available at www.springerlink.com copyright (c) 2011 Springer Basel AG.
oai:research-repository.st-andrews.ac.uk:10023/61572022-04-13T14:30:10Zcom_10023_196com_10023_39com_10023_58com_10023_19com_10023_879com_10023_878col_10023_197col_10023_59col_10023_880
Mapping parallel programs to heterogeneous CPU/GPU architectures using a Monte Carlo Tree Search
Goli, Mehdi
McCall, John
Brown, Christopher Mark
Janjic, Vladimir
Hammond, Kevin
European Commission
European Commission
EPSRC
EPSRC
University of St Andrews. School of Computer Science
University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Monte Carlo Tree Search
Heuristic algorithm
Static mapping
Parallel programming
Heterogenous architecture
QA75 Electronic computers. Computer science
The single core processor, which has dominated for over 30 years, is now obsolete with recent trends increasing towards parallel systems, demanding a huge shift in programming techniques and practices. Moreover, we are rapidly moving towards an age where almost all programming will be targeting parallel systems. Parallel hardware is rapidly evolving, with large heterogeneous systems, typically comprising a mixture of CPUs and GPUs, becoming the mainstream. Additionally, with this increasing heterogeneity comes increasing complexity: not only does the programmer have to worry about where and how to express the parallelism, they must also express an efficient mapping of resources to the available system. This generally requires in-depth expert knowledge that most application programmers do not have. In this paper we describe a new technique that derives, automatically, optimal mappings for an application onto a heterogeneous architecture, using a Monte Carlo Tree Search algorithm. Our technique exploits high-level design patterns, targeting a set of well-specified parallel skeletons. We demonstrate that our MCTS on a convolution example obtained speedups that are within 5% of the speedups achieved by a hand-tuned version of the same application.
2015-03-03T11:31:05Z
2015-03-03T11:31:05Z
2013-06-20
Conference item
Goli , M , McCall , J , Brown , C M , Janjic , V & Hammond , K 2013 , Mapping parallel programs to heterogeneous CPU/GPU architectures using a Monte Carlo Tree Search . in 2013 IEEE Congress on Evolutionary Computation, CEC 2013 . IEEE , pp. 2932-2939 . https://doi.org/10.1109/CEC.2013.6557926
9781479904532
9781479904525
PURE: 51070558
PURE UUID: 8ee5d875-a11f-462c-b0f7-672d81284a62
Scopus: 84881588847
ORCID: /0000-0002-4326-4562/work/33080456
ORCID: /0000-0001-6030-2885/work/70619184
http://hdl.handle.net/10023/6157
https://doi.org/10.1109/CEC.2013.6557926
n/a
FP&-ICT-2011-7
EP/G055181/1
EP/F030657/1
eng
2013 IEEE Congress on Evolutionary Computation, CEC 2013
© © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
IEEE