Amazon Linux 2 – Modern, Stable, and Enterprise-Friendly
I’m getting ready to wrap up my work for the year, cleaning up my inbox and catching up on a few recent AWS launches that happened at and shortly after AWS re:Invent.
Last week we launched Amazon Linux 2. This is modern version of Linux, designed to meet the security, stability, and productivity needs of enterprise environments while giving you timely access to new tools and features. It also includes all of the things that made the Amazon Linux AMI popular, including AWS integration,
Long-Term Support – You can use Amazon Linux 2 in situations where you want to stick with a single major version of Linux for an extended period of time, perhaps to avoid re-qualifying your applications too frequently. This build (2017.12) is a candidate for LTS status; the final determination will be made based on feedback in the
Extras Library – You can now get fast access to fresh, new functionality while keeping your base OS image stable and lightweight. The Amazon Linux Extras Library eliminates the age-old tradeoff between OS stability and access to fresh software. It contains open source databases, languages, and more, each packaged together with any needed dependencies.
Tuned Kernel – You have access to the latest 4.9 LTS kernel, with support for the latest EC2 features and tuned to run efficiently in AWS and other virtualized environments.
Systemd – Amazon Linux 2 includes the systemd init system, designed to provide better boot performance and increased control over individual services and groups of interdependent services. For example, you can indicate that Service B must be started only after Service A is fully started, or that Service C should start on a change in network connection status.
Wide Availabilty – Amazon Linux 2 is available in all AWS Regions in AMI and Docker image form. Virtual machine images for Hyper-V, KVM, VirtualBox, and VMware are also available. You can build and test your applications on your laptop or in your own data center and then deploy them to AWS.
I’m interested in the Extras Library; here’s how I see which topics (lists of packages) are available:
As you can see, the library includes languages, editors, and web tools that receive frequent updates. Each topic contains all of dependencies that are needed to install the package on Amazon Linux 2. For example, the Rust topic includes the cmake build system for Rust, cargo for Rust package maintenance, and the LLVM-based compiler toolchain for Rust.
Here’s how I install a topic (Emacs 25.3):
SNS Updates
Many AWS customers use the Amazon Linux AMIs as a starting point for their own AMIs. If you do this and would like to kick off your build process whenever a new AMI is released, you can subscribe to an SNS topic:
You can be notified by email, invoke a AWS Lambda function, and so forth.
Available Now
Amazon Linux 2 is available now and you can start using it in the cloud and on-premises today! To learn more, read the Amazon Linux 2 LTS Candidate (2017.12) Release Notes.
— Jeff;
相關推薦
Amazon Linux 2 – Modern, Stable, and Enterprise-Friendly
I’m getting ready to wrap up my work for the year, cleaning up my inbox and catching up on a few recent AWS launches that happened at and shortly
在 Amazon Linux 或 Amazon Linux 2 上安裝 SSM 代理
本文Copy 自 https://docs.aws.amazon.com/zh_cn/systems-manager/latest/userguide/sysman-manual-agent-install.html 在 Amazon Linux 或 Amazon Linux 2 上安裝 SSM
Codeforces Round #365 (Div. 2) D - Mishka and Interesting sum(離線樹狀數組)
turn string 之前 algorithm printf ace r++ void contest http://codeforces.com/contest/703/problem/D 題意: 給出一行數,有m次查詢,每次查詢輸出區間內出現次數為偶數次的數字的異
Have You Tried Delphi on Amazon Linux? (就是AWS用的Linux)
enables custom customers servers nbsp ble exists compile targe The new Delphi Linux compiler enables customers to take new or existing Wi
【動態規劃】 Codeforces Round #416 (Div. 2) C. Vladik and Memorable Trip
and main spa def esp 動態 return 價值 can 劃分那個序列,沒必要完全覆蓋原序列。對於劃分出來的每個序列,對於某個值v,要麽全都在該序列,要麽全都不在該序列。 一個序列的價值是所有不同的值的異或和。整個的價值是所有劃分出來的序列的價值之和。
【分類討論】【spfa】【BFS】Codeforces Round #416 (Div. 2) D. Vladik and Favorite Game
邊界情況 code def bfs spa eof scan string amp 那個人第一步肯定要麽能向下走,要麽能向右走。於是一定可以判斷出上下是否對調,或者左右是否對調。 然後他往這個方向再走一走就能發現一定可以再往旁邊走,此時就可以判斷出另一個方向是否對調。 都判
[Codeforces Round #261 (Div. 2) E]Pashmak and Graph(Dp)
solution and other main ems scanf homework max urn Description Pashmak‘s homework is a problem about graphs. Although he always tries
[Linux Sets] hosts, wlan and other net-rele
-i login ... ubuntu wan sta apt-get ati sets 1.host I want to login Google... hosts: /etc/hosts vi /etc/hosts to edit 2.wlan I want to
Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads 模擬 枚舉
ces color 一次 name exit main cst space amp Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads 模擬 枚舉 題意 一個紅綠燈 按逆時針方向一次給出各個路口的左轉,
(博弈sg) Codeforces Round #417 (Div. 2) E Sagheer and Apple Tree
paths 相同 friend pri 產生 chan star ren have Sagheer is playing a game with his best friend Soliman. He brought a tree with n nodes numbered
Codeforces Round #420 (Div. 2) E. Okabe and El Psy Kongroo(矩陣)
clu blank his 題目 pri 狀態 oid c++ class 題目鏈接:Codeforces Round #420 (Div. 2) E. Okabe and El Psy Kongroo 題意: 在一個二維方格子裏有n條線段,有三種走法 (x?+?1,?y?
Codeforces Round #417 (Div. 2) E. Sagheer and Apple Tree(樹上Nim)
ide vector 等於 如果 ace ble 技術 方式 復雜度 題目鏈接:Codeforces Round #417 (Div. 2) E. Sagheer and Apple Tree 題意: 給你一棵樹,每個節點有a[i]個蘋果,有兩個人要在這個樹上玩遊戲。 兩個
Codeforces Round #263 (Div. 2) D. Appleman and Tree 樹形dp
鏈接 樹形dp targe 代碼 else 多少 color turn def 鏈接: http://codeforces.com/contest/462/problem/D 題意: 給定n個點的樹, 0為根,下面n-1行表示每個點的父節點 最後一行n個數 表示每
Codeforces Round #432 (Div. 2) D. Arpa and a list of numbers(暴力)
esp for int ans logs and codeforce style inf 枚舉質數,判斷是否超過臨界值。臨界值就是將不是因子中不含這個素數的數的個數乘以x和y的較小值,是否小於當前最小值。 #include <algorithm> #inclu
Codeforces Round #435 (Div. 2) D. Mahmoud and Ehab and the binary string[二分]
cstring stream ++ else fine eps comm 簡單的 hab 題目:http://codeforces.com/problemset/problem/862/D 題意:交互題,詢問15次以內Hamming distance,輸出一個二進制串
Codeforces Round #435 (Div. 2) E. Mahmoud and Ehab and the function(預處理+二分)
class [1] can 行處理 long 個數 分享 amp abs 題目鏈接:點我點我 題意:公式:,給出n個數,從a[1]到a[n],和m個數(b數組),然後從b數組裏挑出連續的n個數(也就m-n+1中選擇),按公式計算,使得f最小, 還有q次對a數組的操作(某
Codeforces Round #355 (Div. 2) D. Vanya and Treasure 分治暴力
復雜度 font level -1 exactly tput %d test air D. Vanya and Treasure Vanya is in the palace that can be represented as a grid n?×?m. Each
Computer Architecture Lecture 2: Fundamental Concepts and ISA
man vliw serial mmu vol struct inter com car Moore‘s Law Reliability Memory Wall Programmability Wall Design complexity Power
Codeforces Round #384 (Div. 2) E. Vladik and cards 狀壓dp
答案 clu test none urn 數字 ble inline return Codeforces Round #384 (Div. 2) E. Vladik and cards 狀壓dp 大致題意: 給定一個序列an,序列中只有1~8的8個整數,讓你選出一個子序列
Codeforces Round #442 (Div. 2) B. Nikita and string
style force c++ its class char 每次 包含 子串 題意:給一個字符串,問形如a……a/ /b……b/ /a……a的子串最大長度 題解:設三個狀態a,ab,aba分別表示對應長度。因為每段長度可以為0,所以後一個狀態的包含前一個狀態。每次更新