a scalable server for 3d metaverses
play

A Scalable Server for 3D Metaverses Ewen Cheslack-Postava, Tahir - PowerPoint PPT Presentation

A Scalable Server for 3D Metaverses Ewen Cheslack-Postava, Tahir Azim, Behram F.T. Mistree, Daniel Reiter Horn, Je ff Terrace, Philip Levis, and Michael J. Freedman sirikata.com Metaverses 2 Metaverses 3 Metaverses 3 Metaverses 3


  1. A Scalable Server for 3D Metaverses Ewen Cheslack-Postava, Tahir Azim, Behram F.T. Mistree, Daniel Reiter Horn, Je ff Terrace, Philip Levis, and Michael J. Freedman sirikata.com

  2. Metaverses 2

  3. Metaverses 3

  4. Metaverses 3

  5. Metaverses 3

  6. Metaverses Applications: • Games • Augmented reality • Historical recreations • Collaborative visualization • ... what will users create? 4

  7. 5

  8. 6

  9. 7

  10. 8

  11. These are systems problems. 9

  12. Object Discovery 10

  13. Object Discovery 10

  14. Object Discovery 10

  15. How do we scale up the world without limiting the scope of interaction? 11

  16. Sirikata Seamless, scalable, and federated metaverses 12

  17. Insight The real world scales. 13

  18. Design Principle Scale by applying real-world constraints to the system. 14

  19. Object Discovery 15

  20. Object Discovery 15

  21. Solid Angle Queries Insight : Limited display resolution Solid angle: how large an object appears 16

  22. Ideal 17

  23. Distance, 3000 Objects 18

  24. Solid Angle, 3000 Objects 19

  25. Solid Angle & Aggregates, 3000 Objects 20

  26. Ideal 21

  27. Object Discovery Solid angle queries are global. How do we e ffi ciently and scalably evaluate solid angle queries? 22

  28. Data Structure - BVH 23

  29. Data Structure - BVH C D A B A B C D 23

  30. Data Structure - BVH C D X X A B A B C D 23

  31. Data Structure - BVH Y C D X X Y A B A B C D 23

  32. Data Structure - BVH Y Z C Z D X X Y A B A B C D 23

  33. Data Structure - BVH Q Y Z C Z D X X Y A B A B C D 24

  34. Data Structure - BVH Q Y Z C Z D X X Y A B A B C D 25

  35. Data Structure - BVH Q Y Z C Z D X X Y A B A B C D 26

  36. New Data Structure - LBVH Q Y Z C Z (A) D X X (A) Y (C) A B A B C D 27

  37. New Data Structure - LBVH Q Y Z A C Z (A) D X X (A) Y (C) A B A B C D 27

  38. LBVH 75 - 90% fewer nodes tested than with BVH 28

  39. Dynamic Objects Moving objects make the LBVH ine ffi cient over time X A B 29

  40. Dynamic Objects Moving objects make the LBVH ine ffi cient over time X A B 29

  41. Dynamic Objects ��������������������������������� ���� ������������������������������� ���� ����� ���� ���� ���� �������������������� ������������ ���� � ����� ������� ������� ������� ������� ������������������ 30

  42. Dynamic Objects ��������������������������������� ���� ������������������������������� ���� ����� ���� ���� ���� �������������������� ������������ ���� � ����� ������� ������� ������� ������� ������������������ Split between static and dynamic objects 30

  43. Dynamic Objects 10 - 15% less expensive during short, 100 second experiment Bene fi t improves over time 31

  44. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  45. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  46. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  47. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  48. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  49. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  50. Standing Queries Z (A) X (A) Y (C) A B C D Cuts avoid redundant work

  51. Standing Queries 20 - 56% increase in query evaluation rate 38

  52. Aggregation Z (A) X (A) Y (C) A B C D 39

  53. Aggregation Z (A) X (A) Y (C) A B C D 39

  54. Aggregation Z (A) X (A) Y (C) A B C D 39

  55. Aggregation Z (A) X (A) Y (C) A B C D 39

  56. Aggregation Z (A) X (A) Y (C) A B C D 39

  57. Aggregate Queries • Queries on a server are all similar • Aggregate queries to reduce inter- server querying load • Filter results further before returning results to querier 40

  58. Server Discovery 10 41 10

  59. Server Discovery • Geometric server discovery • Determine which other servers need to be queried • Built on same LBVH data structure 42

  60. 43

  61. 44

  62. Also in the Paper • Globally consistent distributed data structure mapping regions to servers • Global routing table enabling all-pairs communication • Forwarder with intuitive, physically- based weighting emphasizing local tra ffi c 45

  63. Wiki World Automatically fi nd information about objects on Wikipedia 46

  64. But wait, there’s more... There are many more systems challenges at the intersection of systems, graphics, PL, databases, ... A few examples: • Audio: distant siren, roar of a crowd • E ffi cient property updates 47

  65. Thank You Download and code at sirikata.com Questions? 48

Recommend


More recommend