Singly Linked List

The Head Node and Singly Linked List

头结点与单链表

Design choices in a concurrent , singly linked list

并发单向链表的设计方法

Using a singly linked list .

使用单向链接列表实现。

Each scheduler class is linked with one another in a singly linked list , allowing the classes to be iterated ( for example , for the purposes of enablement of disablement on a given processor ) .

每个调度器类都在一对一连接的列表中彼此相连，使类可以迭代（例如，要启用给定处理器的禁用）。

Aiming at the postorder-traversal of a binary tree 's time complexity in single process being O ( n ), an algorithm under EREW PRAM is presented . The algorithm makes the edge of the traversal into a singly linked list .

针对单处理器后序遍历二叉树的时间复杂度为O（n）问题，提出了在EREWPRAM并行计算模型下一种后序遍历二叉树的算法。