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

a scalable server for 3d metaverses
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

A Scalable Server for 3D Metaverses

Ewen Cheslack-Postava, Tahir Azim, Behram F.T. Mistree, Daniel Reiter Horn, Jeff Terrace, Philip Levis, and Michael J. Freedman

sirikata.com

slide-2
SLIDE 2

Metaverses

2

slide-3
SLIDE 3

Metaverses

3

slide-4
SLIDE 4

Metaverses

3

slide-5
SLIDE 5

Metaverses

3

slide-6
SLIDE 6

Metaverses

  • Games
  • Augmented reality
  • Historical recreations
  • Collaborative visualization
  • ... what will users create?

4

Applications:

slide-7
SLIDE 7

5

slide-8
SLIDE 8

6

slide-9
SLIDE 9

7

slide-10
SLIDE 10

8

slide-11
SLIDE 11

9

These are systems problems.

slide-12
SLIDE 12

10

Object Discovery

slide-13
SLIDE 13

10

Object Discovery

slide-14
SLIDE 14

10

Object Discovery

slide-15
SLIDE 15

11

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

slide-16
SLIDE 16

Sirikata

12

Seamless, scalable, and federated metaverses

slide-17
SLIDE 17

Insight

13

The real world scales.

slide-18
SLIDE 18

Design Principle

14

Scale by applying real-world constraints to the system.

slide-19
SLIDE 19

15

Object Discovery

slide-20
SLIDE 20

15

Object Discovery

slide-21
SLIDE 21

Solid Angle Queries

16

Insight: Limited display resolution Solid angle: how large an object appears

slide-22
SLIDE 22

17

Ideal

slide-23
SLIDE 23

18

Distance, 3000 Objects

slide-24
SLIDE 24

19

Solid Angle, 3000 Objects

slide-25
SLIDE 25

20

Solid Angle & Aggregates, 3000 Objects

slide-26
SLIDE 26

21

Ideal

slide-27
SLIDE 27

22

Object Discovery

Solid angle queries are global. How do we efficiently and scalably evaluate solid angle queries?

slide-28
SLIDE 28

Data Structure - BVH

23

slide-29
SLIDE 29

Data Structure - BVH

23

A B C D A B C D

slide-30
SLIDE 30

Data Structure - BVH

23

A B C D X A B C D X

slide-31
SLIDE 31

Data Structure - BVH

23

A B C D X Y A B C D X Y

slide-32
SLIDE 32

Data Structure - BVH

23

A B C D X Y Z A B C D X Y Z

slide-33
SLIDE 33

Data Structure - BVH

24

A C D Y A B C D X Y Z Q B X Z

slide-34
SLIDE 34

Data Structure - BVH

25

A C D Y A B C D X Y Z Q B X Z

slide-35
SLIDE 35

Data Structure - BVH

26

A C D Y A B C D X Y Z Q B X Z

slide-36
SLIDE 36

New Data Structure - LBVH

27

A C D Y A B C D X (A) Y (C) Z (A) B X Z Q

slide-37
SLIDE 37

New Data Structure - LBVH

27

A C D Y A B C D X (A) Y (C) Z (A) B X Z Q A

slide-38
SLIDE 38

LBVH

28

75 - 90% fewer nodes tested than with BVH

slide-39
SLIDE 39

Dynamic Objects

29

Moving objects make the LBVH inefficient over time A B X

slide-40
SLIDE 40

Dynamic Objects

29

Moving objects make the LBVH inefficient over time A B X

slide-41
SLIDE 41

Dynamic Objects

30

slide-42
SLIDE 42

Dynamic Objects

30

  • Split between static and dynamic objects
slide-43
SLIDE 43

Dynamic Objects

31

10 - 15% less expensive during short, 100 second experiment Benefit improves over time

slide-44
SLIDE 44

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-45
SLIDE 45

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-46
SLIDE 46

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-47
SLIDE 47

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-48
SLIDE 48

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-49
SLIDE 49

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-50
SLIDE 50

Standing Queries

A B C D X (A) Y (C) Z (A) Cuts avoid redundant work

slide-51
SLIDE 51

Standing Queries

38

20 - 56% increase in query evaluation rate

slide-52
SLIDE 52

Aggregation

39

A B C D X (A) Y (C) Z (A)

slide-53
SLIDE 53

Aggregation

39

A B C D X (A) Y (C) Z (A)

slide-54
SLIDE 54

Aggregation

39

A B C D X (A) Y (C) Z (A)

slide-55
SLIDE 55

Aggregation

39

A B C D X (A) Y (C) Z (A)

slide-56
SLIDE 56

Aggregation

39

A B C D X (A) Y (C) Z (A)

slide-57
SLIDE 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

slide-58
SLIDE 58

Server Discovery

41

10

10

slide-59
SLIDE 59

Server Discovery

  • Geometric server discovery
  • Determine which other servers need to

be queried

  • Built on same LBVH data structure

42

slide-60
SLIDE 60

43

slide-61
SLIDE 61

44

slide-62
SLIDE 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 traffic

45

slide-63
SLIDE 63

Wiki World

46

Automatically find information about

  • bjects on Wikipedia
slide-64
SLIDE 64

But wait, there’s more...

  • Audio: distant siren, roar of a crowd
  • Efficient property updates

47

There are many more systems challenges at the intersection of systems, graphics, PL, databases, ... A few examples:

slide-65
SLIDE 65

Thank You

Download and code at

sirikata.com

Questions?

48