Moving efficiently in the CLI

I'm tired of pounding on the arrow keys when moving in the command line, but I keep on forgetting the keyboard shorcuts that would help me move more efficiently, so here's a simple diagram in a flashcard format for future reference!

 

 

I found a useful table with most of those in the How Linux Works book that I'm currently reading, and some more on Stack Overflow.

If you plan on using them, please bear in mind that these keyboard shorcuts depend on quite a number of things: the Unix distribution that you're using, your shell, your own configuration quirks... so YMMV.

 

原文网址:https://clementc.github.io/blog/2018/01/25/moving_cli/

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
The schedule() scheduling algorithm is a core part of the Linux kernel's process scheduler, which manages the allocation of CPU resources to processes running on the system. The algorithm is responsible for deciding which process should be executed next based on a variety of factors, including the priority of the process, any time constraints or deadlines that need to be met, and the availability of CPU resources. The specific functions that are included in the schedule() algorithm will vary depending on the version of Linux being used and the specific configuration of the system. However, some of the key functions that are typically included in the schedule() algorithm include: - Priority management: The algorithm includes functions for managing the priority levels of different processes running on the system. This allows the kernel to prioritize high-priority tasks and ensure that they receive the necessary CPU resources to execute efficiently. - Time accounting: The algorithm includes functions for tracking how much CPU time each process has used, which helps the kernel make informed decisions about which process to execute next. - Context switching: The algorithm includes functions for switching between different processes as they are executed on the CPU. This involves saving the current state of the process being executed and restoring the state of the next process in the queue. - Synchronization: The algorithm includes functions for synchronizing access to shared resources, such as memory or disk I/O. This helps prevent conflicts and ensures that processes can access resources in a safe and efficient manner. Overall, the schedule() algorithm is a critical part of the Linux kernel's process scheduler, and its functions help ensure that the system can efficiently allocate CPU resources to the processes running on it.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值