-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconcurrent.bib
200 lines (187 loc) · 17.7 KB
/
concurrent.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
@inproceedings{boehm_threads_2005,
address = {New York, NY, USA},
series = {{PLDI} '05},
title = {Threads {Cannot} {Be} {Implemented} {As} a {Library}},
isbn = {978-1-59593-056-9},
url = {http://doi.acm.org/10.1145/1065010.1065042},
doi = {10.1145/1065010.1065042},
abstract = {In many environments, multi-threaded code is written in a language that was originally designed without thread support (e.g. C), to which a library of threading primitives was subsequently added. There appears to be a general understanding that this is not the right approach. We provide specific arguments that a pure library approach, in which the compiler is designed independently of threading issues, cannot guarantee correctness of the resulting code.We first review why the approach almost works, and then examine some of the surprising behavior it may entail. We further illustrate that there are very simple cases in which a pure library-based approach seems incapable of expressing an efficient parallel algorithm.Our discussion takes place in the context of C with Pthreads, since it is commonly used, reasonably well specified, and does not attempt to ensure type-safety, which would entail even stronger constraints. The issues we raise are not specific to that context.},
urldate = {2019-06-04},
booktitle = {Proceedings of the 2005 {ACM} {SIGPLAN} {Conference} on {Programming} {Language} {Design} and {Implementation}},
publisher = {ACM},
author = {Boehm, Hans-J.},
year = {2005},
note = {event-place: Chicago, IL, USA},
keywords = {data race, optimization, pthreads, register promotion, threads},
pages = {261--268},
file = {Boehm_2005_Threads Cannot Be Implemented As a Library.pdf:/home/jhosoume/Zotero/ACM/2005/Boehm_2005_Threads Cannot Be Implemented As a Library.pdf:application/pdf}
}
@article{sharma_comparative_2014,
title = {Comparative {Study} of {Parallel} {Programming} {Models} to {Compute} {Complex} {Algorithm}},
volume = {96},
doi = {10.5120/16900-6961},
abstract = {The main goal of this research is to use OpenMP, Posix Threads and MicrosoftParallel Patternslibraries to design an algorithm to compute Matrix Multiplication effectively. By using the libraries of OpenMP, Posix Threads and Microsoft Parallel PatternsLibraries, onecan optimize the speedup of the algorithm. First step is to write simple program which calculates a predetermined Matrix and gives the results, after compilation and execution of the code. In this stage only single core processor is used to calculate the Matrix multiplication. Later on, in this research OpenMP, Posix Threads and Microsoft Parallel Patternslibraries are added separately and use some functions in the code to parallelize the computation, by using those functions multi-cores of a processor are allowed. Then execute the program and check its run time, then a timer functionis added to the code which periodically checks the time it took for the computer to do the parallelization. First the program is run without the Parallel libraries, and then with the OpenMP, Posix Threads and with MicrosoftParallel Patterns libraries code. Then program is executed for each input Matrix size and result is collected. Maximum 5 trials for each input size are conducted and record the time it took for the computer to parallelize the Matrix multiplication. Finally comparison of the performance in terms of execution time and speed up for OpenMP, Posix Threads and Microsoft Parallel Patternslibraries is done using different Matrix Dimensions and different number of processors},
journal = {International Journal of Computer Applications},
author = {Sharma, Mukul and Soni, Pradeep},
month = jun,
year = {2014},
pages = {9--12},
file = {Sharma_Soni_2014_Comparative Study of Parallel Programming Models to Compute Complex Algorithm.pdf:/home/jhosoume/Zotero/International Journal of Computer Applications/2014/Sharma_Soni_2014_Comparative Study of Parallel Programming Models to Compute Complex Algorithm.pdf:application/pdf}
}
@inproceedings{jakimovska_performance_2012,
title = {Performance estimation of parallel processing techniques on various platforms},
doi = {10.1109/℡FOR.2012.6419482},
abstract = {As information society changes, the digital world is making more use of larger bulks of data and complex operations that need to be executed. This trend has caused overcoming the processor speed limit issues, by introducing multiple processor systems. In spite of hardware-level parallelism, the software has evolved with various techniques for achieving parallel programs execution. Executing a program in parallel can be efficiently done only if the program code follows certain rules. There are many techniques, which tend to provide variant processing speeds. The aim of this paper is to test the Matlab, OpenMPI and Pthreads methods on a single-processor, multi-processor, GRID and cluster systems and suggest optimal method for that particular system.},
booktitle = {2012 20th {Telecommunications} {Forum} (℡{FOR})},
author = {Jakimovska, D. and Jakimovski, G. and Tentov, A. and Bojchev, D.},
month = nov,
year = {2012},
keywords = {Hardware, Cluster, cluster systems, digital world, GRID, GRID systems, hardware-level parallelism, Instruction sets, Libraries, Matlab, MATLAB, message passing, Message systems, multiple processor systems, multiprocessing systems, OpenMPI, Parallel processing, parallel processing techniques, parallel programming, parallel programs execution, performance estimation, program code, Pthreads, Pthreads methods, single-processor},
pages = {1409--1412},
file = {IEEE Xplore Abstract Record:/home/jhosoume/Zotero/storage/X5E7ESMB/6419482.html:text/html;Jakimovska et al_2012_Performance estimation of parallel processing techniques on various platforms.pdf:/home/jhosoume/Zotero/undefined/2012/Jakimovska et al_2012_Performance estimation of parallel processing techniques on various platforms.pdf:application/pdf}
}
@misc{myers_application_nodate,
title = {An {Application} of {Pthreads} and {Mutexes} - {PDF}},
url = {https://technodocbox.com/C_and_CPP/72710400-An-application-of-pthreads-and-mutexes.html},
abstract = {An Application of Pthreads and Mutexes Ethan Y. Myers Cedar Brook Academy 1.0 Introduction An Application of Pthreads and Mutexes The paper Multiprocessing Using Pthreads and Mutexes [1] describes the},
urldate = {2019-06-04},
journal = {Cedar Brook Academy},
author = {Myers, Ethan},
file = {Snapshot:/home/jhosoume/Zotero/storage/4P42M3CS/An-application-of-pthreads-and-mutexes.html:text/html}
}
@article{hofbauer_evolutionary_2003,
title = {Evolutionary game dynamics},
volume = {40},
issn = {0273-0979, 1088-9485},
url = {https://www.ams.org/bull/2003-40-04/S0273-0979-03-00988-1/},
doi = {10.1090/S0273-0979-03-00988-1},
abstract = {Evolutionary game dynamics is the application of population dynamical methods to game theory. It has been introduced by evolutionary biologists, anticipated in part by classical game theorists. In this survey, we present an overview of the many brands of deterministic dynamical systems motivated by evolutionary game theory, including ordinary differential equations (and, in particular, the replicator equation), differential inclusions (the best response dynamics), difference equations (as, for instance, fictitious play) and reaction-diffusion systems. A recurrent theme (the so-called `folk theorem of evolutionary game theory') is the close connection of the dynamical approach with the Nash equilibrium, but we show that a static, equilibrium-based viewpoint is, on principle, unable to always account for the long-term behaviour of players adjusting their behaviour to maximise their payoff.},
language = {en},
number = {4},
urldate = {2019-06-04},
journal = {Bulletin of the American Mathematical Society},
author = {Hofbauer, Josef and Sigmund, Karl},
year = {2003},
pages = {479--519},
file = {Hofbauer_Sigmund_2003_Evolutionary game dynamics.pdf:/home/jhosoume/Zotero/Bulletin of the American Mathematical Society/2003/Hofbauer_Sigmund_2003_Evolutionary game dynamics.pdf:application/pdf;Snapshot:/home/jhosoume/Zotero/storage/59DQSLAW/S0273-0979-03-00988-1.html:text/html}
}
@incollection{hammerstein_chapter_1994,
title = {Chapter 28 {Game} theory and evolutionary biology},
volume = {2},
url = {http://www.sciencedirect.com/science/article/pii/S1574000505800608},
abstract = {The subject matter of evolutionary game theory is the analysis of conflict and cooperation in animals and plants. Originally, game theory was developed as a theory of human strategic behavior based on an idealized picture of rational decision making. Evolutionary game theory does not rely on rationality assumptions but on the idea that the Darwinian process of natural selection drives organisms toward the optimization of reproductive success. Most of evolutionary game theory focuses on those cases where stable equilibrium is reached. However, the dynamics of evolutionary processes in disequilibrium is also an active area of research. In principle, evolutionary game theory deals only with fully symmetric games. Asymmetric conflicts are embedded in symmetric games where each player has the same chance to be on each side of the conflict. The mathematical definition of evolutionary stability refers to symmetric games only. Because asymmetric conflicts can be embedded in symmetric games, this is no obstacle for the treatment of asymmetric conflicts.},
urldate = {2019-06-04},
booktitle = {Handbook of {Game} {Theory} with {Economic} {Applications}},
publisher = {Elsevier},
author = {Hammerstein, Peter and Selten, Reinhard},
month = jan,
year = {1994},
doi = {10.1016/S1574-0005(05)80060-8},
pages = {929--993},
file = {Hammerstein_Selten_1994_Chapter 28 Game theory and evolutionary biology.pdf:/home/jhosoume/Zotero/Elsevier/1994/Hammerstein_Selten_1994_Chapter 28 Game theory and evolutionary biology.pdf:application/pdf;ScienceDirect Snapshot:/home/jhosoume/Zotero/storage/RX98PIBD/S1574000505800608.html:text/html}
}
@incollection{camerer_behavioural_2004,
address = {London},
title = {Behavioural {Game} {Theory}: {Thinking}, {Learning} and {Teaching}},
isbn = {978-0-230-52337-1},
shorttitle = {Behavioural {Game} {Theory}},
url = {https://doi.org/10.1057/9780230523371_8},
abstract = {Game theory is a mathematical system for analysing and predicting how humans behave in strategic situations. Standard equilibrium analyses assume that all players: (1) form beliefs based on an analysis of what others might do (strategic thinking); (2) choose the best response given those beliefs (optimization); and (3) adjust best responses and beliefs until they are mutually consistent (equilibrium).},
language = {en},
urldate = {2019-06-04},
booktitle = {Advances in {Understanding} {Strategic} {Behaviour}: {Game} {Theory}, {Experiments} and {Bounded} {Rationality}},
publisher = {Palgrave Macmillan UK},
author = {Camerer, Colin F. and Ho, Teck-Hua and Chong, Juin Kuan},
editor = {Huck, Steffen},
year = {2004},
doi = {10.1057/9780230523371_8},
keywords = {Fictitious Play, Mixed Equilibrium, Nash Equilibrium, Quantal Response Equilibrium, Trust Game},
pages = {120--180},
file = {Camerer et al_2004_Behavioural Game Theory.pdf:/home/jhosoume/Zotero/Palgrave Macmillan UK/2004/Camerer et al_2004_Behavioural Game Theory.pdf:application/pdf}
}
@article{cudd_game_1993,
title = {Game {Theory} and the {History} of {Ideas} about {Rationality}: {An} {Introductory} {Survey}},
volume = {9},
issn = {1474-0028, 0266-2671},
shorttitle = {Game {Theory} and the {History} of {Ideas} about {Rationality}},
url = {https://www.cambridge.org/core/journals/economics-and-philosophy/article/game-theory-and-the-history-of-ideas-about-rationality-an-introductory-survey/05A95F0FBF74BB706CFEB9BB6A1836DA},
doi = {10.1017/S0266267100005137},
abstract = {Although it may seem from its formalism that game theory must have sprung from the mind of John von Neumann as a corollary of his work on computers or theoretical physics, it should come as no real surprise to philosophers that game theory is the articulation of a historically developing philosophical conception of rationality in thought and action. The history of ideas about rationality is deeply contradictory at many turns. While there are theories of rationality that claim it is fundamentally social and aims at understanding and molding all facets of human psychological life, game theory takes rationality to be essentially located in individuals and to concern only the means to achieve predetermined ends. Thus, there are some thinkers who have made important contributions to this history who do not appear in the story of game theory at all, among them, Plato, Kant, and Hegel. There is, however, a clear trail to follow linking theories of instrumental rationality from Aristotle to the nineteenth-century marginalist economists and ultimately to von Neumann and Morgenstern and contemporary game theorists, that historically grounds game theory as a model of rational interaction.},
language = {en},
number = {1},
urldate = {2019-06-04},
journal = {Economics \& Philosophy},
author = {Cudd, Ann E.},
month = apr,
year = {1993},
pages = {101--133},
file = {Snapshot:/home/jhosoume/Zotero/storage/R744H24F/05A95F0FBF74BB706CFEB9BB6A1836DA.html:text/html}
}
@article{axelrod_further_1988,
title = {The {Further} {Evolution} of {Cooperation}},
volume = {242},
copyright = {© 1988 by the American Association for the Advancement of Science.},
issn = {0036-8075, 1095-9203},
url = {https://science.sciencemag.org/content/242/4884/1385},
doi = {10.1126/science.242.4884.1385},
abstract = {Axelrod's model of the evolution of cooperation was based on the iterated Prisoner's Dilemma. Empirical work following this approach has helped establish the prevalence of cooperation based on reciprocity. Theoretical work has led to a deeper understanding of the role of other factors in the evolution of cooperation: the number of players, the range of possible choices, variation in the payoff structure, noise, the shadow of the future, population dynamics, and population structure.},
language = {en},
number = {4884},
urldate = {2019-06-04},
journal = {Science},
author = {Axelrod, Robert and Dion, Douglas},
month = dec,
year = {1988},
pmid = {17802133},
pages = {1385--1390},
file = {Axelrod_Dion_1988_The Further Evolution of Cooperation.pdf:/home/jhosoume/Zotero/Science/1988/Axelrod_Dion_1988_The Further Evolution of Cooperation.pdf:application/pdf;Snapshot:/home/jhosoume/Zotero/storage/ZQIQ6LFP/1385.html:text/html}
}
@article{jervis_realism_1988,
title = {Realism, {Game} {Theory}, and {Cooperation}},
volume = {40},
issn = {1086-3338, 0043-8871},
url = {https://www.cambridge.org/core/journals/world-politics/article/realism-game-theory-and-cooperation/0FFBC3C1EA03F867D77C1EED7623B228},
doi = {10.2307/2010216},
abstract = {Recent work has focused on the problem of how states cooperate in the environment of anarchy. Linked to the ideas of the Prisoners' Dilemma and public goods, that work has provided important insights and lines of research. But it also has problems and limitations, which are explored in the paper. The anarchy approach stresses individual actors' choices and slights questions of how issues are posed and constrained. It takes preferences as given without exploring either the frequency of PD situations or the ways in which preferences are formed and can change. Many of the concepts the framework uses—e.g., cooperation and defection, the distinction between offense and defense, and the nature of power—are problematical. Issues of beliefs, perceptions, norms, and values also lead to a different perspective on cooperation.},
language = {en},
number = {3},
urldate = {2019-06-04},
journal = {World Politics},
author = {Jervis, Robert},
month = apr,
year = {1988},
pages = {317--349},
file = {Snapshot:/home/jhosoume/Zotero/storage/7QKAZZMZ/0FFBC3C1EA03F867D77C1EED7623B228.html:text/html}
}
@misc{noauthor_effective_nodate,
title = {Effective {Choice} in the {Prisoner}'s {Dilemma} - {Robert} {Axelrod}, 1980},
url = {https://journals.sagepub.com/doi/abs/10.1177/002200278002400101},
urldate = {2019-06-04},
file = {Effective Choice in the Prisoner's Dilemma - Robert Axelrod, 1980:/home/jhosoume/Zotero/storage/QMI6RR3Z/002200278002400101.html:text/html}
}
@article{fehr_nature_2003,
title = {The nature of human altruism},
volume = {425},
copyright = {2003 Macmillan Magazines Ltd.},
issn = {1476-4687},
url = {https://www.nature.com/articles/nature02043},
doi = {10.1038/nature02043},
abstract = {Some of the most fundamental questions concerning our evolutionary origins, our social relations, and the organization of society are centred around issues of altruism and selfishness. Experimental evidence indicates that human altruism is a powerful force and is unique in the animal world. However, there is much individual heterogeneity and the interaction between altruists and selfish individuals is vital to human cooperation. Depending on the environment, a minority of altruists can force a majority of selfish individuals to cooperate or, conversely, a few egoists can induce a large number of altruists to defect. Current gene-based evolutionary theories cannot explain important patterns of human altruism, pointing towards the importance of both theories of cultural evolution as well as gene–culture co-evolution.},
language = {En},
number = {6960},
urldate = {2019-06-04},
journal = {Nature},
author = {Fehr, Ernst and Fischbacher, Urs},
month = oct,
year = {2003},
pages = {785},
file = {Snapshot:/home/jhosoume/Zotero/storage/ANRM9RZK/nature02043.html:text/html}
}
@misc{barney_posix_nodate,
title = {{POSIX} {Threads} {Programming}},
url = {https://computing.llnl.gov/tutorials/pthreads/},
urldate = {2019-06-04},
journal = {Lawrence Livermore National Laboratory},
author = {Barney, Blaise},
file = {POSIX Threads Programming:/home/jhosoume/Zotero/storage/LPF3CJ9E/pthreads.html:text/html}
}