The Game Trace Archive

Guo, Yang; Iosup, Alexandru

doi:10.1109/netgames.2012.6404027

Cited by 27 publications

(19 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The synthetic graph ("Synth" in Table II) is produced by the generator described in Graph500 [31]. The other graphs have been extracted from real-world use, and have been shared through the Stanford Network Analysis Project (SNAP) [35]) and the Game Trace Archive (GTA) [2].…”

Section: ) Graph Selectionmentioning

confidence: 99%

How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis

Guo

Biczak

Vărbănescu

et al. 2014

2014 IEEE 28th International Parallel and Distributed Processing Symposium

Self Cite

101

View full text Add to dashboard Cite

Abstract-Graph-processing platforms are increasingly used in a variety of domains. Although both industry and academia are developing and tuning graph-processing algorithms and platforms, the performance of graph-processing platforms has never been explored or compared in-depth. Thus, users face the daunting challenge of selecting an appropriate platform for their specific application. To alleviate this challenge, we propose an empirical method for benchmarking graph-processing platforms. We define a comprehensive process, and a selection of representative metrics, datasets, and algorithmic classes. We implement a benchmarking suite of five classes of algorithms and seven diverse graphs. Our suite reports on basic (user-lever) performance, resource utilization, scalability, and various overhead. We use our benchmarking suite to analyze and compare six platforms. We gain valuable insights for each platform and present the first comprehensive comparison of graph-processing platforms.

show abstract

Section: ) Graph Selectionmentioning

confidence: 99%

How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis

Guo

Biczak

Vărbănescu

et al. 2014

2014 IEEE 28th International Parallel and Distributed Processing Symposium

Self Cite

101

View full text Add to dashboard Cite

show abstract

“…For the future, we plan to investigate more mapping strategies, especially multi-thresholded, and apply them and the strategies proposed in this work to the datasets collected in the Game Trace Archive [22]. We also intend to explore other practical applications for the formalism we have proposed in this study.…”

Section: Discussionmentioning

confidence: 99%

Understanding and recommending play relationships in online social gaming

Bovenkamp

Shen

Iosup

et al. 2013

2013 Fifth International Conference on Communication Systems and Networks (COMSNETS)

Self Cite

View full text Add to dashboard Cite

Abstract-Online Social Networking (OSN) applications such as Facebook's communication and Zynga's gaming platforms service hundreds of millions of users. To understand and model such relationships, social network graphs are extracted from running OSN applications and subsequently processed using social and complex network analysis tools. In this paper, we focus on the application domain of Online Social Games (OSGs) and deploy a formalism for extracting graphs from large datasets. Our formalism covers notions such as game participation, adversarial relationships, match outcomes, and allows to filter out "weak" links based on one or more threshold values. Using two novel large-scale OSG datasets, we investigate a range of threshold values and their influence on the resulting OSG graph properties. We discuss how an analysis of multiple graphs-obtained through different extraction rules-could be used in an algorithm to improve matchmaking for players.

show abstract

“…We conduct experiments using three real-world workloads LCG, Grid5000, and Dotalicious which are taken from public workload archives [16][17][18]. LCG and Grid5000 contain information about the computing activities of two grids while DotaLicious contains workload information of a game platform.…”

Section: Methodsmentioning

confidence: 99%

Scheduling Jobs in the Cloud Using On-Demand and Reserved Instances

Shen

Deng

Iosup

et al. 2013

Euro-Par 2013 Parallel Processing

Self Cite

View full text Add to dashboard Cite

Abstract. Deploying applications in leased cloud infrastructure is increasingly considered by a variety of business and service integrators. However, the challenge of selecting the leasing strategy -larger or faster instances? on-demand or reserved instances? etc.-and to configure the leasing strategy with appropriate scheduling policies is still daunting for the (potential) cloud user. In this work, we investigate leasing strategies and their policies from a broker's perspective. We propose, CoH, a family of Cloud-based, online Hybrid scheduling policies that minimizes rental cost by making use of both on-demand and reserved instances. We formulate the resource provisioning and job allocation policies as Integer Programming problems. As the policies need to be executed online, we limit the time to explore the optimal solution of the integer program, and compare the obtained solution with various heuristics-based policies; then automatically pick the best one. We show, via simulation and using multiple real-world traces, that the hybrid leasing policy can obtain significantly lower cost than typical heuristics-based policies.

show abstract

The Game Trace Archive

Cited by 27 publications

References 20 publications

How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis

How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis

Understanding and recommending play relationships in online social gaming

Scheduling Jobs in the Cloud Using On-Demand and Reserved Instances

Contact Info

Product

Resources

About