Abstract: An atherectomy catheter having an inner drive shaft which rotates a distal rotary tissue borer with a helical cutting surface which enables the catheter to cut through and cross a CTO. Additionally, the atherectomy catheter has a distal cutting element rotated by an outer drive shaft configured to cut material from the wall of a vessel at a treatment site as the catheter is pushed distally through the treatment site. The atherectomy catheter includes a collection chamber positioned proximally of the cutting element and rotary tissue borer. The atherectomy catheter may include means to direct material cut from the treatment site into the collection chamber, means to break down larger portions of material that may block or clog the collection chamber and means of transporting the material collected from the treatment site to a proximal opening in the atherectomy catheter.

Abstract: Techniques are provided for reducing synchronization of tasks in a task scheduling system. A task queue includes multiple tasks, some of which require an I/O operation while other tasks require data stored locally in memory. A single thread is assigned to process tasks in the task queue. The thread determines if a task at the head of the task queue requires an I/O operation. If so, then the thread generates an I/O request, submits the I/O request, and may place the task at (or toward) the end of the task queue. When the task reaches the head of the task queue again, the thread determines if data requested by the I/O request is available yet. If so, then the thread processes the request. Otherwise, the thread may place the task at (or toward) the end of the task queue again.

Abstract: Techniques for generating and transferring bulk messages from one computing device to another computing device in a cluster are provided. Each computing device in a cluster is assigned a different set of nodes of a graph. A first computing device may be assigned a particular node that is neighbors with multiple other nodes that are assigned to one or more other computing devices in the cluster. When processing graph-related code at the first computing device, information about the neighbors may be required. The first computing device receives a bulk message from one of the other computing devices. The bulk message contains information about at least a subset of the neighbors. Therefore, the first computing device is not required to send multiple messages for information about the subset of neighbors. In fact, the first computing device is not required to send any message for the information.

Abstract: Techniques are provided for efficiently distributing graph data to multiple processor threads located on a server node. The server node receives graph data to be processed by the server node of a graph processing system. The received graph data is a portion of a larger graph to be processed by the graph processing system. In response to receiving graph data the server node compiles a list of vertices and attributes of each vertex from the graph data received. The server node then creates task chunks of work based upon the compiled list of vertices and their corresponding attribute data. The server node then distributes the task chunks to a plurality of threads available on the server node.

Abstract: Techniques are provided for efficiently distributing graph data to multiple processor threads located on a server node. The server node receives graph data to be processed by the server node of a graph processing system. The received graph data is a portion of a larger graph to be processed by the graph processing system. In response to receiving graph data the server node compiles a list of vertices and attributes of each vertex from the graph data received. The server node then creates task chunks of work based upon the compiled list of vertices and their corresponding attribute data. The server node then distributes the task chunks to a plurality of threads available on the server node.

Abstract: Techniques are provided for reducing synchronization of tasks in a task scheduling system. A task queue includes multiple tasks, some of which require an I/O operation while other tasks require data stored locally in memory. A single thread is assigned to process tasks in the task queue. The thread determines if a task at the head of the task queue requires an I/O operation. If so, then the thread generates an I/O request, submits the I/O request, and may place the task at (or toward) the end of the task queue. When the task reaches the head of the task queue again, the thread determines if data requested by the I/O request is available yet. If so, then the thread processes the request. Otherwise, the thread may place the task at (or toward) the end of the task queue again.

Abstract: Techniques are provided for efficiently distributing graph data to multiple processor threads located on a server node. The server node receives graph data to be processed by the server node of a graph processing system. The received graph data is a portion of a larger graph to be processed by the graph processing system. In response to receiving graph data the server node compiles a list of vertices and attributes of each vertex from the graph data received. The server node then creates task chunks of work based upon the compiled list of vertices and their corresponding attribute data. The server node then distributes the task chunks to a plurality of threads available on the server node.

Abstract: Techniques are provided for latency-hiding context management for concurrent distributed tasks. A plurality of task objects is processed, including a first task object corresponding to a first task that includes access to first data residing on a remote machine. A first access request is added to a request buffer. A first task reference identifying the first task object is added to a companion buffer. A request message including the request buffer is sent to the remote machine. A response message is received, including first response data responsive to the first access request. For each response of one or more responses of the response message, the response is read from the response message, a next task reference is read from the companion buffer, and a next task corresponding to the next task reference is continued based on the response. The first task is identified and continued.

Abstract: Techniques are provided for efficiently distributing graph data to multiple processor threads located on a server node. The server node receives graph data to be processed by the server node of a graph processing system. The received graph data is a portion of a larger graph to be processed by the graph processing system. In response to receiving graph data the server node compiles a list of vertices and attributes of each vertex from the graph data received. The server node then creates task chunks of work based upon the compiled list of vertices and their corresponding attribute data. The server node then distributes the task chunks to a plurality of threads available on the server node.

Abstract: Techniques for generating and transferring bulk messages from one computing device to another computing device in a cluster are provided. Each computing device in a cluster is assigned a different set of nodes of a graph. A first computing device may be assigned a particular node that is neighbors with multiple other nodes that are assigned to one or more other computing devices in the cluster. When processing graph-related code at the first computing device, information about the neighbors may be required. The first computing device receives a bulk message from one of the other computing devices. The bulk message contains information about at least a subset of the neighbors. Therefore, the first computing device is not required to send multiple messages for information about the subset of neighbors. In fact, the first computing device is not required to send any message for the information.

Abstract: Techniques are provided for latency-hiding context management for concurrent distributed tasks. A plurality of task objects is processed, including a first task object corresponding to a first task that includes access to first data residing on a remote machine. A first access request is added to a request buffer. A first task reference identifying the first task object is added to a companion buffer. A request message including the request buffer is sent to the remote machine. A response message is received, including first response data responsive to the first access request. For each response of one or more responses of the response message, the response is read from the response message, a next task reference is read from the companion buffer, and a next task corresponding to the next task reference is continued based on the response. The first task is identified and continued.

Abstract: Techniques are provided for reducing synchronization of tasks in a task scheduling system. A task queue includes multiple tasks, some of which require an I/O operation while other tasks require data stored locally in memory. A single thread is assigned to process tasks in the task queue. The thread determines if a task at the head of the task queue requires an I/O operation. If so, then the thread generates an I/O request, submits the I/O request, and places the task at (or toward) the end of the task queue. When the task reaches the head of the task queue again, the thread determines if data requested by the I/O request is available yet. If so, then the thread processes the request. Otherwise, the thread places the task at (or toward) the end of the task queue again.

Abstract: An atherectomy catheter having an inner drive shaft which rotates a distal rotary tissue borer with a helical cutting surface which enables the catheter to cut through and cross a CTO. Additionally, the atherectomy catheter has a distal cutting element rotated by an outer drive shaft configured to cut material from the wall of a vessel at a treatment site as the catheter is pushed distally through the treatment site. The atherectomy catheter includes a collection chamber positioned proximally of the cutting element and rotary tissue borer. The atherectomy catheter may include means to direct material cut from the treatment site into the collection chamber, means to break down larger portions of material that may block or clog the collection chamber and means of transporting the material collected from the treatment site to a proximal opening in the atherectomy catheter.

Abstract: An atherectomy catheter having an inner drive shaft which rotates a distal rotary tissue borer with a helical cutting surface which enables the catheter to cut through and cross a CTO. Additionally, the atherectomy catheter has a distal cutting element rotated by an outer drive shaft configured to cut material from the wall of a vessel at a treatment site as the catheter is pushed distally through the treatment site. The atherectomy catheter includes a collection chamber positioned proximally of the cutting element and rotary tissue borer. The atherectomy catheter may include means to direct material cut from the treatment site into the collection chamber, means to break down larger portions of material that may block or clog the collection chamber and means of transporting the material collected from the treatment site to a proximal opening in the atherectomy catheter.

Abstract: Filters used in the food and beverage industry can be cleaned by contacting the filters with a cyclic nitroxyl compound and a reoxidator or with a nitroxonium compound in a bromine-free process. The nitroxyl can be TEMPO or its 4-acetamido or 4-acetoxy derivative, and the nitroxonium compound can be the corresponding oxidized ion obtained by enzymatic or metal catalyzed oxidation. The reoxidator may be a peracid, such as peracetic acid, persulphuric acid or permanganic acid, or a metal complex with a hydroperoxide.