Xinyu Que

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yandong Wang

> Home > Persons > Xinyu Que

Publications

2015
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/YuWQX15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/YuWQX15
Weikuan Yu, Yandong Wang, Xinyu Que, Cong Xu:
Virtual Shuffling for Efficient Data Movement in MapReduce. IEEE Trans. Computers 64(2): 556-568 (2015)
2014
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/YuWQ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/YuWQ14
Weikuan Yu, Yandong Wang, Xinyu Que:
Design and Evaluation of Network-Levitated Merge for Hadoop Acceleration. IEEE Trans. Parallel Distributed Syst. 25(3): 602-611 (2014)
2012
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/wbdb/WangJXLWQCWLBY12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wbdb/WangJXLWQCWLBY12
Yandong Wang, Yizheng Jiao, Cong Xu, Xiaobing Li, Teng Wang, Xinyu Que, Cristian Cira, Bin Wang, Zhuo Liu, Bliss Bailey, Weikuan Yu:
Assessing the Performance Impact of High-Speed Interconnects on MapReduce. WBDB 2012: 148-163
2011
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/sc/WangQYGS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sc/WangQYGS11
Yandong Wang, Xinyu Que, Weikuan Yu, Dror Goldenberg, Dhiraj Sehgal:
Hadoop acceleration through network levitated merge. SC 2011: 57:1-57:10

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.