Scale Cast – A Podcast About Big Data, Distributed Systems, And Scalability podcast

Pagina principale della serie•Feed

32:08

Did you know there’s an actual science to uncovering your hidden genius? It’s not about filling out a “dream job” worksheet—it’s about understanding how your brain is wired, identifying your natural aptitudes, and using them to thrive. This isn’t just a self-discovery exercise. It’s a game-changer for your career, your relationships, and how you show up in the world. Betsy Wills and Alex Ellison are redefining how we approach career discovery, proving that finding the right path isn’t just about landing a job—it’s about creating a life that aligns with who you actually are. ✅ Betsy Wills – Cofounder of YouScience, a groundbreaking psychometric assessment platform reshaping how we understand our talents. She’s also the Director of Marketing & Branding at Diversified Trust and a frequent lecturer at Vanderbilt University and NYU’s Stern School of Business. ✅ Alex Ellison – Founder of Throughline Guidance, a global college and career counseling practice. She’s a sought-after writer, speaker, and expert in college readiness and career development. ✅ Together, they co-authored Your Hidden Genius: The Science-Backed Strategy to Uncovering and Harnessing Your Innate Talents. Discovering your hidden genius isn’t just about career success—it’s about tapping into what makes you, you . Connect with Betsy & Alex: Website (Free Downloads): www.yourhiddengenius.com Book: https://www.harpercollins.com/products/your-hidden-genius-elizabeth-m-willsalexandra-ellison Related Podcast Episodes: How To Be You, But Better with Olga Khazan | 288 Finding Purpose Through Human Design with Emma Dunwoody | 228 195 / Finding (And Using) Your Voice with Amy Green Smith Share the Love: If you found this episode insightful, please share it with a friend, tag us on social media, and leave a review on your favorite podcast platform! 🔗 Subscribe & Review: Apple Podcasts | Spotify | Amazon Music…

Scale Cast – A podcast about big data, distributed systems, and scalability

A podcast about big data, distributed systems, and scalability

9 episodi

#Video

Scale Cast – A podcast about big data, distributed systems, and scalability

45 subscribers

updated 17 anni fa

Pagina principale della serie•Feed

A podcast about big data, distributed systems, and scalability

9 episodi

#Video

Tutti gli episodi

Scale Cast – A podcast about big data, distributed systems, and scalability

1
An Introduction to ZooKeeper Video

17 years fa

—

In 2006 we were building distributed applications that needed a master, aka coordinator, aka controller to manage the sub processes of the applications. It was a scenario that we had encountered before and something that we saw repeated over and over again inside and outside of Yahoo!. For example, we have an application that consists of a bunch of processes. Each process needs be aware of other processes in the system. The processes need to know how requests are partitioned among the processes. They need to be aware of configuration changes and failures. Generally an application specific central control process manages these needs, but generally these control programs are specific to applications and thus represent a recurring development cost for each distributed application. Because each control program is rewritten it doesn’t get the investment of development time to become truly robust, making it an unreliable single point of failure. link to podcast…

Scale Cast – A podcast about big data, distributed systems, and scalability

1
More Optimal Bloom Filters

17 years fa

—

The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives. For example, one might use a Bloom filter to do spell-checking in a space-efficient way. A Bloom filter to which a dictionary of correct words has been added will accept all words in the dictionary and reject almost all words which are not, which is good enough in some cases. Depending on the false positive rate, the resulting data structure can require as little as a byte per dictionary word. In the last few years Bloom filter become hot topic again and there were several modifications and improvements. In this talk I will present my last few improvements in this topic. Speaker: Ely Porat Ely Porat received his Doctorate from Bar-Ilan University in 2000. Following that, he fulfilled his military service and, in parallel, worked as a faculty member at Bar-Ilan University. Having spent the spring 2007 semester as a Visiting Scientist in Google, he is now back at Bar-Ilan University. The main body of Ely Porat’s work concerns matching problems: string matching, pattern matching, subset matching. He also worked on the nearest pair problem in high-dimensional spaces as well as sketching and edit distance. link…

Scale Cast – A podcast about big data, distributed systems, and scalability

1
An Overview of High Performance Computing and Challenges for the Future

17 years fa

—

In this talk we examine how high performance computing has changed over the last 10-year and look toward the future in terms of trends. These changes have had and will continue to have a major impact on our software. A new generation of software libraries and algorithms are needed for the effective and reliable use of (wide area) dynamic, distributed and parallel environments. Some of the software and algorithm challenges have already been encountered, such as management of communication and memory hierarchies through a combination of compile–time and run–time techniques, but the increased scale of computation, depth of memory hierarchies, range of latencies, and increased run–time environment variability will make these problems much harder. Link to video…

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Disk-Based Parallel Computation, Rubik’s Cube, and Checkpointin

17 years fa

—

This talk takes us on a journey through three varied, but interconnected topics. First, our research lab has engaged in a series of disk-based computations extending over five years. Disks have traditionally been used for filesystems, for virtual memory, and for databases. Disk-based computation opens up an important fourth use: an abstraction for multiple disks that allows parallel programs to treat them in a manner similar to RAM. The key observation is that 50 disks have approximately the same parallel bandwidth as a _single_ RAM subsystem. This leaves latency as the primary concern. A second key is the use of techniques like delayed duplicate detection to avoid latency link to video…

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Lecture 5: Cluster Computing and MapReduce

17 years fa

—

link to video

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Lecture 3: Cluster Computing and MapReduce

17 years fa

—

link to video

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Lecture 4: Cluster Computing and MapReduce

17 years fa

—

link to video

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Lecture 2: Cluster Computing and MapReduce

17 years fa

—

link to video

Scale Cast – A podcast about big data, distributed systems, and scalability

1
Lecture 1: Cluster Computing and MapReduce

17 years fa