Garbage collection
•Download as PPT, PDF•
0 likes•603 views
Introduction to garbage collection
Report
Share
Report
Share
Recommended
Remotee
This document discusses the benefits and possibilities of remote work. It argues that remote work is now possible for many jobs that may not have traditionally been remote, such as programmers. Some benefits of remote work include flexibility in location and hours. To gain remote work opportunities, employees should first prove themselves by working in the office to build trust with their manager and team. With the proper tools like video conferencing and project management software, remote work can be done efficiently. The document outlines several case studies that found cost and time savings, as well as increased employee satisfaction, from implementing remote work policies.
Chrome extensions dev Intro
A brief introduction of what is an extension and How to built one for the Chrome browser that we all love. It includes some example of popular extensions and a little demo of a plugin I built to watch movies from Yify Torrent.
Analyzing Java Applications Using Thermostat (Omair Majid)
Ever wondered how your Java application is actually working? How it's making use of scarce resources on your machine? Ever tried to look under the hood of the Java Virtual Machine (JVM) and felt lost with various tools that don't provide an overall picture, only local details? Thermostat is an open source serviceability tool to help Java developers understand what's happening inside the JVM when their programs are running. Thermostat collects and combines information from various sources—including the Hotspot JVM—to present a complete picture of how the application is behaving. In this session, you'll get a chance to see Thermostat in action as it's used to examine various Java applications, identify what's wrong and fix those problems—often without even modifying the application code. You'll also learn how to add more features to Thermostat through plug-ins. If you're a developer, sysadmin, or QA, and if there's Java in your technology stack, you'll want to learn how Thermostat can make your life easier.
Write Powerful Javascript Modules To Make Your Apps DRY (Brian Leathem)
Large-scale Javascript applications benefit from a modular approach that let code be reused both within the application and across repeated implementations. In this session, we'll look at the modular approach used to build reusable Javascript modules in the Red Hat mobile field workforce management application (WFM) showcased in this year's Summit middleware keynote demo. Reusable modules for WFM are packaged as node package manager (npm) modules, providing a consistent format for both server and client sides using Node.js and Browserify. Modules are loosely coupled using the Mediator pattern and they broadcast user actions and state changes giving the application and other modules the opportunity to hook into those events. Additionally, visual components are packaged in a framework-agnostic manner, providing reusable UI components. You'll leave this session understanding the challenges faced when building reusable modules for large-scale applications, and the solutions employed in building out the reusable WFM modules.
Gimme Caching - The JCache Way
Hey guys, lemme tell ya a story.
Once upon a time, we’re talking about the year 2001, a few people had an amazing idea. They were thinking about something that would change the world. It would make the world easy and give programmers almost unlimited power! It was simply referred to as JSR 107, one of the least things to change in the upcoming future. But those pals were way ahead of their time and nothing really happend. So time passed by and by and by and over the years it was buried in the deep catacombs of the JCP. Eventually, in 2011, two brave knights took on the fight and worked themselves through all the pathlessness, to finalize it in 2014. Lads you know what I’m talking about, they called it the “Java Caching API” or in short “JCache”. Yes you heard me, a Java standard for Caching!
Recommended
Remotee
This document discusses the benefits and possibilities of remote work. It argues that remote work is now possible for many jobs that may not have traditionally been remote, such as programmers. Some benefits of remote work include flexibility in location and hours. To gain remote work opportunities, employees should first prove themselves by working in the office to build trust with their manager and team. With the proper tools like video conferencing and project management software, remote work can be done efficiently. The document outlines several case studies that found cost and time savings, as well as increased employee satisfaction, from implementing remote work policies.
Chrome extensions dev Intro
A brief introduction of what is an extension and How to built one for the Chrome browser that we all love. It includes some example of popular extensions and a little demo of a plugin I built to watch movies from Yify Torrent.
Analyzing Java Applications Using Thermostat (Omair Majid)
Ever wondered how your Java application is actually working? How it's making use of scarce resources on your machine? Ever tried to look under the hood of the Java Virtual Machine (JVM) and felt lost with various tools that don't provide an overall picture, only local details? Thermostat is an open source serviceability tool to help Java developers understand what's happening inside the JVM when their programs are running. Thermostat collects and combines information from various sources—including the Hotspot JVM—to present a complete picture of how the application is behaving. In this session, you'll get a chance to see Thermostat in action as it's used to examine various Java applications, identify what's wrong and fix those problems—often without even modifying the application code. You'll also learn how to add more features to Thermostat through plug-ins. If you're a developer, sysadmin, or QA, and if there's Java in your technology stack, you'll want to learn how Thermostat can make your life easier.
Write Powerful Javascript Modules To Make Your Apps DRY (Brian Leathem)
Large-scale Javascript applications benefit from a modular approach that let code be reused both within the application and across repeated implementations. In this session, we'll look at the modular approach used to build reusable Javascript modules in the Red Hat mobile field workforce management application (WFM) showcased in this year's Summit middleware keynote demo. Reusable modules for WFM are packaged as node package manager (npm) modules, providing a consistent format for both server and client sides using Node.js and Browserify. Modules are loosely coupled using the Mediator pattern and they broadcast user actions and state changes giving the application and other modules the opportunity to hook into those events. Additionally, visual components are packaged in a framework-agnostic manner, providing reusable UI components. You'll leave this session understanding the challenges faced when building reusable modules for large-scale applications, and the solutions employed in building out the reusable WFM modules.
Gimme Caching - The JCache Way
Hey guys, lemme tell ya a story.
Once upon a time, we’re talking about the year 2001, a few people had an amazing idea. They were thinking about something that would change the world. It would make the world easy and give programmers almost unlimited power! It was simply referred to as JSR 107, one of the least things to change in the upcoming future. But those pals were way ahead of their time and nothing really happend. So time passed by and by and by and over the years it was buried in the deep catacombs of the JCP. Eventually, in 2011, two brave knights took on the fight and worked themselves through all the pathlessness, to finalize it in 2014. Lads you know what I’m talking about, they called it the “Java Caching API” or in short “JCache”. Yes you heard me, a Java standard for Caching!
Vert.X mini-talk
Vert.x is an asynchronous application platform that runs on the JVM and supports multiple programming languages. It uses an event-driven, non-blocking model where event handlers are used to avoid blocking threads. Verticles are deployed units that isolate classloading and contain event loops with event handlers. The event bus allows asynchronous messaging between verticles on the same or different machines. Worker verticles can be used to handle blocking operations so as not to block the event loop.
Breaking the Fourth Wall in Software
Latest trends indicate that more people tend to spend time on messaging platforms than on traditional social network sites and apps. Chatting with friends/family/coworkers is now expanding to also chatting with online business. Chatbots play central role in this brave new world of text-based conversational commerce.
From Imperative to Functional Programming (for Absolute Beginners)
This document discusses the history and differences between imperative and functional programming paradigms. It explains that functional programming uses immutable data and pure functions without side effects, making programs more reliable and easier to test. Some benefits of the functional approach include improved performance, easier debugging, and the ability to safely deploy updates by simply replacing code. The document provides examples and guidelines for transitioning from imperative to functional programming.
Harnessing asynchronicity callbacks, promises, generators, and coroutines
This document discusses asynchronous programming techniques in JavaScript, including callbacks, promises, generators, and coroutines. It provides code examples of nested callbacks leading to the "pyramid of doom" and "hairball" patterns. Promises and generators are presented as alternatives that improve readability. The document also covers the history and evolution of JavaScript and asynchronous programming libraries like Q and Koa.js that utilize promises and generators.
In-Memory Computing - Distributed Systems - Devoxx UK 2015
Today’s amounts of collected data are showing a nearly exponential growth. More than 75% of all the data have been collected in the past 5 years. To store this data and process it in an appropriate time you need to partition the data and parallelize the processing of reports and analytics. This talk will demonstrate how to parallelize data processing using Hazelcast and it’s underlying distributed data structures. With a quick introduction into the different terms and some short live coding examples we will make the journey into the distributed computing.
Vert.x 3
FinistJug presentation of Vert.X 3
http://finistjug.fr/2015/08/23/soiree-de-rentree-du-finistjug-mardi-15-septembre/
Principles of the Play framework
This document discusses principles of the Play Framework. It emphasizes building APIs that are composable by avoiding side effects as much as possible. It introduces concepts like Enumerators and Iteratees to allow for asynchronous and reactive programming with streams of data. Enumerators produce data asynchronously while Iteratees consume data asynchronously. This allows streaming of data without blocking. The document provides examples of how to compose Enumerators and Iteratees to process streams of data in an asynchronous and non-blocking way. It emphasizes building APIs that are simple building blocks that can be easily composed together through functional composition rather than relying on side effects.
An Adventure in Serverless ClojureScript
For the last few hack days, I've been developing a small clojurescript application using a stack that is fairly new to me: quiescent and figwheel. At the last hack day I finished the application and deployed it as a pure-ClojureScript application with no server-side Clojure code.
I'll demo my application, and talk about some of the things I learned in the process. We'll also live code a ClojureScript web application from scratch and deploy it using Amazon S3 static hosting in a matter of minutes.
Taming complexity in JavaScript
This document discusses techniques for managing complexity in JavaScript applications, including:
- Managing state through approaches like Flux and Redux which use immutable data and pure functions.
- Handling asynchronicity with promises, generators, and async/await.
- Choosing tools and libraries wisely to avoid "JavaScript fatigue" and leverage existing solutions.
- Maintaining code consistency through style guides and linters.
Recursion schemes in Scala
This document discusses recursion schemes and fixed point data types in Scala. It begins by introducing recursion as a way to structure programs using nested function calls. It then provides examples of recursion in various domains like lists, trees, and file systems. The document proposes using fixed point types to define a domain specific language (DSL) for mathematical expressions in a cleaner way by avoiding nested types. It demonstrates how to define the DSL algebraically and use catamorphisms to evaluate expressions by folding over the structure. Catamorphisms, anamorphisms, and hylomorphisms are also briefly introduced. In summary, the document explains how fixed point types and recursion schemes allow for defining composable DSLs in a functional
Event driven microservices with vertx and kubernetes
1) The document discusses event driven microservices using Vert.x and Kubernetes. Vert.x is a toolkit for building reactive applications on the JVM and Hazelcast is an in-memory data grid used for clustering. Kubernetes provides a platform for hosting Docker containers across a cluster of machines and handles tasks like scheduling, health checking, and load balancing.
2) Hazelcast plugins allow Vert.x applications running in Kubernetes to discover cluster nodes using the Kubernetes API. This provides automatic scaling and failover of microservices in a Kubernetes cluster.
3) A demo is shown of a Vert.x application deployed to Kubernetes that uses Hazelcast for service discovery and communication between microservice instances in a clustered environment
Functional programming
1. Functional programming uses functions and avoids variables and assignments.
2. In functional programming, programs are represented as mathematical functions where inputs map to outputs without side effects.
3. Key aspects of functional programming include recursion instead of loops, higher-order functions, and referential transparency where functions always produce the same output for the same inputs.
Concurrency on the JVM
Concurrency on the JVM showing the nuts and bolts of Akka (I presume .. it's not first-hand stuff I'm saying, just speculating). Java Memory Model, Thread Pools, Actors and the likes of that will be covered.
Introducing to Asynchronous Programming
The document introduces asynchronous programming and coroutines. It discusses:
1. The evolution of input/output loops from blocking to asynchronous models using callbacks and futures. Examples include Twisted, Tornado, Tkinter.
2. How futures/promises allow adding callbacks to be notified of results asynchronously, avoiding blocking. Examples shown in JavaScript, Twisted, asyncio.
3. Key aspects of coroutines like yielding and awaiting futures to resume execution asynchronously. Rules for writing asyncio coroutines in Python are provided.
4. Asynchronous programming allows concurrent execution without blocking, improving responsiveness through asynchronous callbacks and coroutines.
autodiscoverable microservices with vertx3
This document discusses microservices and how they can be implemented using Vert.x 3. It begins with defining characteristics of microservices like being component oriented and focusing on business capabilities. It then covers microservice design patterns like architecture, deployment and interaction patterns. Next, it introduces Vert.x 3 as an event driven toolkit for building reactive applications in Java. Key Vert.x 3 concepts are explained like Verticles, the event bus and clustering. The document concludes by proposing a Vert.x 3 microservice framework with components for service Verticles, a service router, registry for service discovery and heartbeats. A demo of this prototype framework is also mentioned.
Lambda Calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any Turing machine and was first introduced by mathematician Alonzo Church in the 1930s as part of his research of the foundations of mathematics.
Lambda calculus consists of constructing lambda terms and performing reduction operations on them
Introduction to lambda expression & lambda calculus
The document introduces lambda expressions and functions for applying functions to lists using lambda. It discusses map, reduce, and filter functions for general list processing. Lambda calculus concepts like fixed point combinators Y and SKI are covered. Recursion can be defined using Y. Examples show applying functions like square to lists using lambda expressions.
Pointers and References
This document discusses pointers and references in various programming languages like C, C++, Java, Python and JavaScript. It covers key concepts like pointers, references, lifetime and ownership, copy and move semantics. It also discusses issues with pointers like dangling pointers and null pointers. References in C++ are described as a safer alternative to pointers. The document also discusses pass by reference, object lifetime, resource management strategies, unique ownership, move semantics and borrowing.
网站前端代码静态检查工具研究
网站测试是要跟大量的前端代码打交道，要跟各种恶心的浏览器打交道，要怎么样才能出淤泥而臭美呢？诀窍一就在于善于利用各种工具来引导工程师写出优美的代码来，本篇就讲述一个笔者最近刚新鲜出炉的一个工具 jsaudit
More Related Content
Viewers also liked
Vert.X mini-talk
Vert.x is an asynchronous application platform that runs on the JVM and supports multiple programming languages. It uses an event-driven, non-blocking model where event handlers are used to avoid blocking threads. Verticles are deployed units that isolate classloading and contain event loops with event handlers. The event bus allows asynchronous messaging between verticles on the same or different machines. Worker verticles can be used to handle blocking operations so as not to block the event loop.
Breaking the Fourth Wall in Software
Latest trends indicate that more people tend to spend time on messaging platforms than on traditional social network sites and apps. Chatting with friends/family/coworkers is now expanding to also chatting with online business. Chatbots play central role in this brave new world of text-based conversational commerce.
From Imperative to Functional Programming (for Absolute Beginners)
This document discusses the history and differences between imperative and functional programming paradigms. It explains that functional programming uses immutable data and pure functions without side effects, making programs more reliable and easier to test. Some benefits of the functional approach include improved performance, easier debugging, and the ability to safely deploy updates by simply replacing code. The document provides examples and guidelines for transitioning from imperative to functional programming.
Harnessing asynchronicity callbacks, promises, generators, and coroutines
This document discusses asynchronous programming techniques in JavaScript, including callbacks, promises, generators, and coroutines. It provides code examples of nested callbacks leading to the "pyramid of doom" and "hairball" patterns. Promises and generators are presented as alternatives that improve readability. The document also covers the history and evolution of JavaScript and asynchronous programming libraries like Q and Koa.js that utilize promises and generators.
In-Memory Computing - Distributed Systems - Devoxx UK 2015
Today’s amounts of collected data are showing a nearly exponential growth. More than 75% of all the data have been collected in the past 5 years. To store this data and process it in an appropriate time you need to partition the data and parallelize the processing of reports and analytics. This talk will demonstrate how to parallelize data processing using Hazelcast and it’s underlying distributed data structures. With a quick introduction into the different terms and some short live coding examples we will make the journey into the distributed computing.
Vert.x 3
FinistJug presentation of Vert.X 3
http://finistjug.fr/2015/08/23/soiree-de-rentree-du-finistjug-mardi-15-septembre/
Principles of the Play framework
This document discusses principles of the Play Framework. It emphasizes building APIs that are composable by avoiding side effects as much as possible. It introduces concepts like Enumerators and Iteratees to allow for asynchronous and reactive programming with streams of data. Enumerators produce data asynchronously while Iteratees consume data asynchronously. This allows streaming of data without blocking. The document provides examples of how to compose Enumerators and Iteratees to process streams of data in an asynchronous and non-blocking way. It emphasizes building APIs that are simple building blocks that can be easily composed together through functional composition rather than relying on side effects.
An Adventure in Serverless ClojureScript
For the last few hack days, I've been developing a small clojurescript application using a stack that is fairly new to me: quiescent and figwheel. At the last hack day I finished the application and deployed it as a pure-ClojureScript application with no server-side Clojure code.
I'll demo my application, and talk about some of the things I learned in the process. We'll also live code a ClojureScript web application from scratch and deploy it using Amazon S3 static hosting in a matter of minutes.
Taming complexity in JavaScript
This document discusses techniques for managing complexity in JavaScript applications, including:
- Managing state through approaches like Flux and Redux which use immutable data and pure functions.
- Handling asynchronicity with promises, generators, and async/await.
- Choosing tools and libraries wisely to avoid "JavaScript fatigue" and leverage existing solutions.
- Maintaining code consistency through style guides and linters.
Recursion schemes in Scala
This document discusses recursion schemes and fixed point data types in Scala. It begins by introducing recursion as a way to structure programs using nested function calls. It then provides examples of recursion in various domains like lists, trees, and file systems. The document proposes using fixed point types to define a domain specific language (DSL) for mathematical expressions in a cleaner way by avoiding nested types. It demonstrates how to define the DSL algebraically and use catamorphisms to evaluate expressions by folding over the structure. Catamorphisms, anamorphisms, and hylomorphisms are also briefly introduced. In summary, the document explains how fixed point types and recursion schemes allow for defining composable DSLs in a functional
Event driven microservices with vertx and kubernetes
1) The document discusses event driven microservices using Vert.x and Kubernetes. Vert.x is a toolkit for building reactive applications on the JVM and Hazelcast is an in-memory data grid used for clustering. Kubernetes provides a platform for hosting Docker containers across a cluster of machines and handles tasks like scheduling, health checking, and load balancing.
2) Hazelcast plugins allow Vert.x applications running in Kubernetes to discover cluster nodes using the Kubernetes API. This provides automatic scaling and failover of microservices in a Kubernetes cluster.
3) A demo is shown of a Vert.x application deployed to Kubernetes that uses Hazelcast for service discovery and communication between microservice instances in a clustered environment
Functional programming
1. Functional programming uses functions and avoids variables and assignments.
2. In functional programming, programs are represented as mathematical functions where inputs map to outputs without side effects.
3. Key aspects of functional programming include recursion instead of loops, higher-order functions, and referential transparency where functions always produce the same output for the same inputs.
Concurrency on the JVM
Concurrency on the JVM showing the nuts and bolts of Akka (I presume .. it's not first-hand stuff I'm saying, just speculating). Java Memory Model, Thread Pools, Actors and the likes of that will be covered.
Introducing to Asynchronous Programming
The document introduces asynchronous programming and coroutines. It discusses:
1. The evolution of input/output loops from blocking to asynchronous models using callbacks and futures. Examples include Twisted, Tornado, Tkinter.
2. How futures/promises allow adding callbacks to be notified of results asynchronously, avoiding blocking. Examples shown in JavaScript, Twisted, asyncio.
3. Key aspects of coroutines like yielding and awaiting futures to resume execution asynchronously. Rules for writing asyncio coroutines in Python are provided.
4. Asynchronous programming allows concurrent execution without blocking, improving responsiveness through asynchronous callbacks and coroutines.
autodiscoverable microservices with vertx3
This document discusses microservices and how they can be implemented using Vert.x 3. It begins with defining characteristics of microservices like being component oriented and focusing on business capabilities. It then covers microservice design patterns like architecture, deployment and interaction patterns. Next, it introduces Vert.x 3 as an event driven toolkit for building reactive applications in Java. Key Vert.x 3 concepts are explained like Verticles, the event bus and clustering. The document concludes by proposing a Vert.x 3 microservice framework with components for service Verticles, a service router, registry for service discovery and heartbeats. A demo of this prototype framework is also mentioned.
Lambda Calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any Turing machine and was first introduced by mathematician Alonzo Church in the 1930s as part of his research of the foundations of mathematics.
Lambda calculus consists of constructing lambda terms and performing reduction operations on them
Introduction to lambda expression & lambda calculus
The document introduces lambda expressions and functions for applying functions to lists using lambda. It discusses map, reduce, and filter functions for general list processing. Lambda calculus concepts like fixed point combinators Y and SKI are covered. Recursion can be defined using Y. Examples show applying functions like square to lists using lambda expressions.
Pointers and References
This document discusses pointers and references in various programming languages like C, C++, Java, Python and JavaScript. It covers key concepts like pointers, references, lifetime and ownership, copy and move semantics. It also discusses issues with pointers like dangling pointers and null pointers. References in C++ are described as a safer alternative to pointers. The document also discusses pass by reference, object lifetime, resource management strategies, unique ownership, move semantics and borrowing.
Viewers also liked (19)
From Imperative to Functional Programming (for Absolute Beginners)
From Imperative to Functional Programming (for Absolute Beginners)
Harnessing asynchronicity callbacks, promises, generators, and coroutines
Harnessing asynchronicity callbacks, promises, generators, and coroutines
In-Memory Computing - Distributed Systems - Devoxx UK 2015
In-Memory Computing - Distributed Systems - Devoxx UK 2015
Event driven microservices with vertx and kubernetes
Event driven microservices with vertx and kubernetes
Introduction to lambda expression & lambda calculus
Introduction to lambda expression & lambda calculus
Similar to Garbage collection
网站前端代码静态检查工具研究
网站测试是要跟大量的前端代码打交道，要跟各种恶心的浏览器打交道，要怎么样才能出淤泥而臭美呢？诀窍一就在于善于利用各种工具来引导工程师写出优美的代码来，本篇就讲述一个笔者最近刚新鲜出炉的一个工具 jsaudit
Debug Your Kubernetes Network
Shared the basic concept of Kubernetes networking and how to have a mindset to debug your networking issue in your Kubernetes cluster.
Comment System of 56.com
1. Comment: the UGC system
2. Pages/Channels that use the comment system
3. The architecture
4. The APIs and Entries
5. MongoDB and ObjectId
6. Comments "Gailou"
7. Indexes of the big tables
Similar to Garbage collection (20)
Garbage collection
- 2. • 历史与发展 • 优缺点 • 原理 • 实现
- 3. 历史与发展 • LISP • ML 系语言 • JVM • C++ • Perl/Python/Ruby • CLR
- 4. 优缺点 优点： a)方便 b)可靠 缺点： • 时间及空间的开销 • 实现和移植的复杂性 （ JVM 和 KVM ） • 底层操作的实现 • 对对象模型的影响
- 5. 优缺点 改善： • 可选式 GC • 允许显式引入不安全操作
- 7. 循环引用 A B 1 1
- 8. 标记 - 清扫算法 • 寻找根对象并标记 • 按照广度优先遍历算 法进行遍历标记 • 任何被标记的都是存 活对象，不会被清除 • 进行清扫过程 √ √ √ √
- 9. 原理 • 引用计数 – 缺点：循环引用 • 标记 - 清扫 – 缺点：效率
- 10. 原理 • 引用计数 – 缺点：循环引用 • 标记 - 清扫 – 缺点：效率 • 分代式收集（ 2 ： 8 原则） – 80% 的对象只存活于 %20 的程序生命期
- 21. 原理 • 引用计数 – 缺点：循环引用 • 标记 - 清扫 – 缺点：效率 • 分代式收集（ 2 ： 8 原则） – 80% 的对象只存活于 %20 的程序生命期 • 复制 - 缩并 – 小内存：只使用缩并算法
- 22. 实现