-
Notifications
You must be signed in to change notification settings - Fork 3
/
codemeta.json
66 lines (66 loc) · 2.13 KB
/
codemeta.json
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
{
"@context": "https://doi.org/10.5063/schema/codemeta-2.0",
"@type": "SoftwareSourceCode",
"license": "https://spdx.org/licenses/MIT",
"codeRepository": "git+https://github.com/lecfab/rescience-gorder.git",
"dateCreated": "2021-01-01",
"datePublished": "2021-01-01",
"name": "Gorder replication",
"description": "This is the source code of the 2021 replication by Fabrice Lécuyer, Maximilien Dabisch and Lionel Tabourier in ReScience of the paper Speedup Graph Processing by Graph Ordering by Hao Wei, Jeffrey Xu Yu, Can Lu, and Xuemin Lin, published in Proceedings of SIGMOD 2016.",
"applicationCategory": "Algorithmics",
"funder": {
"@type": "Organization",
"name": "Sorbonne Université, CNRS, LIP6"
},
"keywords": [
"graph algorithm",
"cache optimisation",
"node ordering",
"gorder"
],
"programmingLanguage": [
"C++",
"Python 3",
"Bash"
],
"softwareRequirements": [
"CLI11 1.9.1",
"GNU Make 4.2.1",
"plotly.js v1.58.4",
"Python 3.8.5",
"matplotlib",
"numpy",
"linux-perf"
],
"author": [
{
"@type": "Person",
"givenName": "Fabrice",
"familyName": "Lécuyer",
"email": "[email protected]",
"affiliation": {
"@type": "Organization",
"name": "Sorbonne Université, CNRS, LIP6, F-75005 Paris, France"
}
},
{
"@type": "Person",
"givenName": "Maximilien",
"familyName": "Danisch",
"affiliation": {
"@type": "Organization",
"name": "Sorbonne Université, CNRS, LIP6, F-75005 Paris, France"
}
},
{
"@type": "Person",
"@id": "https://orcid.org/0000-0002-9160-8083",
"givenName": "Lionel",
"familyName": "Tabourier",
"affiliation": {
"@type": "Organization",
"name": "Sorbonne Université, CNRS, LIP6, F-75005 Paris, France"
}
}
]
}