Process Scheduling Patents (Class 718/102)
  • Patent number: 9542231
    Abstract: The present invention, known as runspace, relates to the field of computing system management, data processing and data communications, and specifically to synergistic methods and systems which provide resource-efficient computation, especially for decomposable many-component tasks executable on multiple processing elements, by using a metric space representation of code and data locality to direct allocation and migration of code and data, by performing analysis to mark code areas that provide opportunities for runtime improvement, and by providing a low-power, local, secure memory management system suitable for distributed invocation of compact sections of code accessing local memory. Runspace provides mechanisms supporting hierarchical allocation, optimization, monitoring and control, and supporting resilient, energy efficient large-scale computing.
    Type: Grant
    Filed: April 13, 2011
    Date of Patent: January 10, 2017
    Assignee: ET International, Inc.
    Inventors: Rishi L. Khan, Daniel Orozco, Guang R. Gao
  • Patent number: 9542295
    Abstract: Inducing perturbation by varying a supply amount of the resource type in the system and measuring performance of the software entity at multiple variation levels of the supply amount of the resource type in the system. A model may be built that characterizes a relationship between the measured performance and the variation levels. The model may be applied to detect the resource bottleneck. The model may be also applied for capacity planning.
    Type: Grant
    Filed: August 19, 2013
    Date of Patent: January 10, 2017
    Assignee: International Business Machines Corporation
    Inventors: Yang Lei, Xiaoqiao Meng, Jian Tan, Li Zhang
  • Patent number: 9542229
    Abstract: A real-time task may initially be performed by a first thread that is executing on a first core of a multi-core processor. A second thread may be initiated to take over the performance of the real-time task on a second core of the multi-core processor while the first thread is performing the real-time task. The performance of the real-time tasks is then transferred from the first thread to the second thread with the execution of the second thread on the second core to perform the real-time task.
    Type: Grant
    Filed: February 17, 2016
    Date of Patent: January 10, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Chih-Yung (Paul) Wang, Yongguang Zhang, Kun Tan, Qiufeng Yin
  • Patent number: 9542396
    Abstract: Managing a file system to avoid unnecessary replay of a transaction log. The file system may reside on a non-volatile storage medium having an associated transaction log residing on a non-volatile storage medium, the transaction log including a plurality of log entries, and each log entry representing one or more changes to metadata of the file system. The file system may include a first data structure including a status parameter, a value of which is indicative of whether to replay the transaction log when the file system is initialized. It may be determined whether the one or more changes to metadata represented by each of the plurality of log entries have been written in place in the file system. In response to the determination, the status parameter may be set to a value indicative of the determination.
    Type: Grant
    Filed: December 27, 2012
    Date of Patent: January 10, 2017
    Assignee: EMC IP Holding Company LLC
    Inventors: Sitaram Pawar, Jean-Pierre Bono, Yubing Wang, Kumar V. K. H. Kanteti, Pranit Sethi
  • Patent number: 9542294
    Abstract: Inducing perturbation by varying a supply amount of the resource type in the system and measuring performance of the software entity at multiple variation levels of the supply amount of the resource type in the system. A model may be built that characterizes a relationship between the measured performance and the variation levels. The model may be applied to detect the resource bottleneck. The model may be also applied for capacity planning.
    Type: Grant
    Filed: July 9, 2013
    Date of Patent: January 10, 2017
    Assignee: International Business Machines Corporation
    Inventors: Yang Lei, Xiaoqiao Meng, Jian Tan, Li Zhang
  • Patent number: 9541979
    Abstract: A method for determining an optimal frequency (fo) for the execution of a software application on an information processing system. The method includes a first execution of said application at a predetermined frequency (fd), making it possible to determine an overall execution time (Tg) and an overall energy consumption (Eg) and a second execution of said application at the same frequency by means of a measurement tool, making it possible to determine measurements (TMPI*, TIO*, Tg*) on said execution; a step of determining a first law providing an execution time (t(f)) as a function of the frequency (f), and a second law providing an energy consumption (E(f)) as a function of the frequency (f); and a step of determining said optimal frequency (fo) as the frequency optimizing a criterion (C(f)) combining said execution time and said energy consumption, as a function of the frequency.
    Type: Grant
    Filed: October 16, 2015
    Date of Patent: January 10, 2017
    Assignee: BULL SAS
    Inventors: Yann Maupu, Thomas Cadeau
  • Patent number: 9536010
    Abstract: Methods, systems, and computer program products for automatically issuing travel documents. Tasks relating to issuance of travel documents are generated by an originating application in response to booking a travel service. The tasks are received and stored in a first queue until a triggering event, such as the arrival of a time for issuance of a document. In response to the triggering event, a task in the first queue may be placed in a second queue for transmission to an issuing application. The documents to be issued may be determined based on records in a passenger name record (PNR) stored in a database. The PNR may be determined based on the task. The PNR may be updated with information indicating whether task processing was successful. In the event of an error, information indicating the cause of the error may be added to the PNR.
    Type: Grant
    Filed: August 11, 2014
    Date of Patent: January 3, 2017
    Assignee: AMADEUS S.A.S.
    Inventors: Carine Daouk, Christelle Pardini, Faustine Avramidis, Romain Rossi, Manuel Tangorra
  • Patent number: 9529838
    Abstract: Avoiding data conflicts includes initiating a transactional lock elision transaction containing a critical section, executing the transactional lock elision transaction including the critical section, and checking a status of a lock prior to a commit point in the transactional lock elision transaction executing, wherein the checking the status occurs after processing the critical section. A determination of whether the status of the lock checked is free is made and responsive to a determination the lock checked is free, a result of the transactional lock elision transaction is committed.
    Type: Grant
    Filed: March 27, 2014
    Date of Patent: December 27, 2016
    Assignee: International Business Machines Corporation
    Inventors: Maged M. Michael, Marcel Mitran, Martin Ohmacht, Kai-Ting Amy Wang
  • Patent number: 9524191
    Abstract: A method and apparatus for providing fairness in a multi-processing element environment is herein described. Mask elements are utilized to associated portions of a reservation station with each processing element, while still allowing common access to another portion of reservation station entries. Additionally, bias logic biases selection of processing elements in a pipeline away from a processing element associated with a blocking stall to provide fair utilization of the pipeline.
    Type: Grant
    Filed: November 8, 2010
    Date of Patent: December 20, 2016
    Assignee: Intel Corporation
    Inventors: Morris Marden, Matthew Merten, Alexandre Farcy, Avinash Sodani, James Hadley, Ilhyun Kim
  • Patent number: 9519869
    Abstract: A method, system and computer-usable medium are disclosed for monitoring a computer system to predict failed or degraded operational states and respond with an alarm or corrective action. Resource collection and consumption are analyzed to derive velocity and acceleration. A hidden Markov model with the resource collection and consumption data as observation spaces predicts computer system state spaced indicative of a failed or degraded computer system operating state.
    Type: Grant
    Filed: November 25, 2013
    Date of Patent: December 13, 2016
    Assignee: International Business Machines Corporation
    Inventor: Jinwoo Hwang
  • Patent number: 9513971
    Abstract: Resource provisioning to a process in a distributed computing system, such as a cloud computing system. An instruction to provision a resource is received. Portions of the resource are provisioned to the process as they become available, and prior to all portions becoming available, based on determining that the provisioning speed is greater than or equal to the use speed for the resource. If the use speed is faster, it may be actively slowed down.
    Type: Grant
    Filed: February 18, 2016
    Date of Patent: December 6, 2016
    Assignee: International Business Machines Corporation
    Inventors: Corville O. Allen, Andrew R. Freed
  • Patent number: 9513967
    Abstract: In an approach for scheduling the execution of a workload in a computing environment, a computer receives a request for scheduling execution of a computing job, wherein the computing job includes a plurality of computing tasks to be executed in a sequence, and wherein at least one computing task requires access to a set of data. The computer identifies information related to the computing environment, wherein the information comprises at least processors available to execute each computing task of the plurality of computing tasks and storage device proximity to the processors. The computer determines an execution configuration for the computing job based, at least in part, on the received request, the information related to the computing environment, and current utilization of the processors' resources. The computer schedules execution of the execution configuration for the computing job.
    Type: Grant
    Filed: September 18, 2014
    Date of Patent: December 6, 2016
    Assignee: International Business Machines Corporation
    Inventors: Parijat Dube, Li Zhang
  • Patent number: 9513958
    Abstract: In some embodiments, techniques include identifying a plurality of tasks associated with an identifier corresponding to an electronic device. A task series is generated so as to include the plurality of tasks, where each task in the series is associated with a performance time. When it is determined that the task has not been completed by the performance time, the task series is updated.
    Type: Grant
    Filed: July 30, 2015
    Date of Patent: December 6, 2016
    Assignee: PEARSON EDUCATION, INC.
    Inventors: Robert Jones, Russell LeWinter
  • Patent number: 9509562
    Abstract: There are provided a method of providing a dynamic node service and a device using the same. The method of providing a dynamic node service that is operated in a fabric controller includes receiving a dynamic node service request, selecting a plurality of system resources including at least one processing unit from among system resources connected with a fabric switch corresponding to the dynamic node service request, and configuring a dynamic node by connecting the plurality of selected system resources to each other through control of the fabric switch. Therefore, it is possible to provide the dynamic node having performance satisfying a user's request.
    Type: Grant
    Filed: October 25, 2013
    Date of Patent: November 29, 2016
    Assignee: ELECTRONICS & TELECOMMUNICATIONS RESEARCH INSTITUTE
    Inventor: Gyu Il Cha
  • Patent number: 9503385
    Abstract: The present invention discloses a delay request processing method and apparatus that are based on a token bucket and relates to the field of communications technologies, where the method and the apparatus are invented to shorten a scanning period when a delay request is processed. The method includes: receiving a delay request message of a queue corresponding to a token bucket, where the delay request message includes delay request time; determining, according to the delay request time, whether the delay request message needs to be processed preferentially; processing the delay request message in a preferentially processing manner when it is determined that the delay request message needs to be processed preferentially. The present invention may be applied to a delay request processing technology.
    Type: Grant
    Filed: September 10, 2014
    Date of Patent: November 22, 2016
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Fei Xie, Guoming Shen, Qingchang Zhong
  • Patent number: 9501254
    Abstract: Systems and methods are provided for utilizing a workflow activity to suppress individual documents of a print job prior to printing. One embodiment is a workflow server that includes an interface and controller. The interface receives a print job that defines documents which each indicate an intended recipient for delivery. The controller directs devices of a print shop by following a print workflow that comprises an ordered set of activities to perform upon the documents. The controller also detects that the print job has reached a scheduled activity of the workflow for pulling documents from the print job based on criteria, identifies documents of the print job that match the criteria indicated by the activity, and removes the identified documents from the print data for the print job before the print job is printed, preventing printing of the identified documents.
    Type: Grant
    Filed: March 31, 2015
    Date of Patent: November 22, 2016
    Assignee: Ricoh Company, Ltd.
    Inventors: Linda Sue Liebelt, Michael Glen Lotz, Kyle P. Manning, Marquis G. Waller
  • Patent number: 9497170
    Abstract: A computer assisted name-based aggregation system that acquires anonymized data from a plurality of service providing systems without obtaining the personal information, and identifies the name of the acquired anonymized data. The computer assisted name-based aggregation system transmits a transmission request that requests transmission of data, and a value that changes for each transmission request to the plurality of service providing systems; receives a set containing hash values created based on an identification number for controlling data and the aforementioned value, and the anonymized data specified by the identification number, from the plurality of service providing systems; and identifies the name of anonymized data specified by the hash value from the anonymized data received from each of the plurality of service providing systems.
    Type: Grant
    Filed: March 27, 2014
    Date of Patent: November 15, 2016
    Assignee: International Business Machines Corporation
    Inventors: Kazuhito Akiyama, Nobuhiro Asai, Masami Tada
  • Patent number: 9495313
    Abstract: A disclosed example apparatus includes a termination panel, a shared bus on the termination panel, and a plurality of bases on the termination panel along the shared bus. Each of the bases is to removably receive modules that are to communicate with field devices. Each of the bases includes first and second physical interfaces. The first physical interface is to be communicatively coupled to different types of the field devices and to exchange communications with one or more of the field devices via a plurality of different communication protocols. The second physical interface is to communicatively couple the removably receivable modules to the shared bus to communicate with a controller via the shared bus.
    Type: Grant
    Filed: January 31, 2014
    Date of Patent: November 15, 2016
    Assignee: Fisher-Rosemount Systems, Inc.
    Inventors: Kent Allan Burr, Gary Keith Law, Doyle Eugene Broom, Mark J. Nixon
  • Patent number: 9495296
    Abstract: Handling memory pressure in an in-database sharded queue is described. Messages from a plurality of enqueuers are stored in a plurality of shards of a sharded queue. Messages from a first enqueuer are stored in a first shard. A queue table corresponding to the sharded queue is maintained. In volatile memory, a plurality of message caches is maintained, each message cache corresponding to a shard of the plurality of shards. Memory pressure is detected based on memory usage of the volatile memory. To store a specific message from the enqueuer, the specific message is stored in rows of the queue table that are assigned to the first shard. When memory pressure is not detected, the specific message is stored in a first message cache corresponding to the first shard. Subscribers of the sharded queue are caused to dequeue messages from the plurality of shards.
    Type: Grant
    Filed: January 28, 2014
    Date of Patent: November 15, 2016
    Assignee: Oracle International Corporation
    Inventors: Sunitha Subramanyam, Shubha Bose, Anil Madan, Devendra Singh, James W. Stamos, Mukesh Jaiswal
  • Patent number: 9489067
    Abstract: A method for determining touch input data complexity and negotiating the processing of touch inputs from a touchscreen controller to a host processor. As touch input data is received from a touchscreen, the data may be evaluated by the touchscreen controller to determine the data's complexity. When the touchscreen controller determines the received touch input data is too complex for touchscreen controller processing, the host processor may be requested to process the data. The touchscreen controller may resume processing touch input data based on low complexity or host processor availability. Complexity may be determined based on evaluations of the number and frequency of touch inputs. Additionally, the touch input data may be evaluated to determine whether it represents multi-touch input. In an aspect, the touchscreen controller may disregard received touch input data determined to be noise.
    Type: Grant
    Filed: August 17, 2012
    Date of Patent: November 8, 2016
    Assignee: QUALCOMM Incorporated
    Inventor: Khosro M. Rabii
  • Patent number: 9483187
    Abstract: Methods, systems, and computer programs are presented for allocating CPU cycles in a storage system. One method includes operations for receiving requests to be processed, and for associating each request to one task. A foreground task is for processing input/output requests, and the foreground task includes one or more flows. Each flow is associated with a queue and a flow counter value, where each queue is configured to hold requests. The method further includes an operation for selecting one task for processing by the CPU based on an examination of the number of cycles processed by the CPU for each task. When the selected task is the foreground task, the flow having the lowest flow counter is selected. The CPU processes a request from the queue of the selected flow, and the flow counter of the selected flow is increased based on the data consumption of the processed task.
    Type: Grant
    Filed: June 23, 2015
    Date of Patent: November 1, 2016
    Assignee: Nimble Storage, Inc.
    Inventors: Gurunatha Karaje, Ajay Gulati, Umesh Maheshwari, Tomasz Barszczak, Vanco Buca
  • Patent number: 9479449
    Abstract: A method of computing is performed in a first processing node of a plurality of processing nodes of multiple types with distinct processing capabilities. The method includes, in response to a command, partitioning data associated with the command among the plurality of processing nodes. The data is partitioned based at least in part on the distinct processing capabilities of the multiple types of processing nodes.
    Type: Grant
    Filed: June 3, 2013
    Date of Patent: October 25, 2016
    Assignee: ADVANCED MICRO DEVICES, INC.
    Inventors: Mauricio Breternitz, Gary Frost
  • Patent number: 9477471
    Abstract: A first and second thread-local counter is allocated to a first and second thread respectively, where the first thread-local counter is updatable only by or on behalf of the first thread and the second thread-local counter is updatable only by or on behalf of the second thread. The first and second thread-local counter are updated and the updated values are communicated to a central process. The central process updates a single counter in a central database by a value equal to the sum of the updated counter values.
    Type: Grant
    Filed: July 7, 2015
    Date of Patent: October 25, 2016
    Assignee: VERSA NETWORKS, INC.
    Inventors: Sridhar Vishwanathan Iyer, Apurva Mehta
  • Patent number: 9471458
    Abstract: The present disclosure provides a method for identifying idleness in a processor via a concurrent software environment. A thread state indicator records an indication of a synchronization state of a software thread that is associated with an identification of the software thread. A time profiler identifies a processor of the computer system being idle and records an indication that the processor is idle. A dispatch monitor identifies a dispatch of the software thread to the processor. In response to the dispatch monitor determining the indication identifies that the processor is idle and the indication of a synchronization state of the software thread indicating the software thread ceases to execute in the processor, the dispatch monitor generates a record attributing the idleness of the processor to the software thread and the indicated synchronization state.
    Type: Grant
    Filed: August 29, 2014
    Date of Patent: October 18, 2016
    Assignee: International Business Machines Corporation
    Inventors: Frank Eliot Levine, David Kevin Siegwart, Enio Manuel Pineda
  • Patent number: 9471907
    Abstract: A system and method may provide for defining a usage policy for an available resource of a personal computing system, and transmitting the usage policy to a market broker. The market broker may identify a match between the usage policy and a request from another computing system, and generate a notification of the match. In addition, funds may be transferred from an account associated with the other computing system to an account associated with the personal computing system based on a remote usage of the available resource by the other computing system.
    Type: Grant
    Filed: December 21, 2010
    Date of Patent: October 18, 2016
    Assignee: Intel Corporation
    Inventors: Jeffrey C. Sedayao, Vishwa Hassan, Cindy A. Smith, Hong Li, Christian D. Black, Terry H. Yoshii, David W. Stone
  • Patent number: 9471383
    Abstract: A method comprises, receiving, at each of a plurality of computing devices, a task execution estimation request message from a central server, the task execution estimation request message comprising a worst-case execution time (WCET) corresponding to the computing device. The method further comprises, computing, by each of the plurality of computing devices, an estimate task execution time for the task based on the WCET and a state transition model corresponding to the computing device, wherein the state transition model indicates available processing resources corresponding to the computing device. Further, the method comprises transmitting, by each of the plurality of computing devices, the estimate task execution time to the central server for allocation of the task to a computing device from amongst the plurality of computing devices based on the estimate task execution time corresponding to the computing device.
    Type: Grant
    Filed: March 24, 2015
    Date of Patent: October 18, 2016
    Assignee: Tata Consultancy Services Limited
    Inventors: Himadri Sekhar Paul, Arijit Mukherjee, Ansuman Banerjee, Swarnava Dey, Arpan Pal, Pubali Datta
  • Patent number: 9465655
    Abstract: A method for managing threads and an electronic device using the method are provided. In the method, a current time is obtained. A time interval from now to a time for the processor to wake up next time is calculated. The processor is released until reaching the end of the time interval. When the end of the time interval is reached or a first notice signal of the processor is received, a first newest time is obtained to update a current time, and the current time is logged as a basis time. It is respectively checked whether the current time satisfies a plurality of predetermined time conditions of the registered threads against a plurality of registered threads in the threads. When the current time satisfies the predetermined time condition of a first registered thread among the registered threads, the first registered thread is waked up.
    Type: Grant
    Filed: November 28, 2012
    Date of Patent: October 11, 2016
    Assignee: HTC Corporation
    Inventors: Pei-Hao Huang, Pei-Jun Ko, Yuan-Yao Tu, Chih-Chun Wei, Yu-Hsien Yang
  • Patent number: 9454460
    Abstract: Methods, systems, and media for providing determinism in multithreaded programs are provided. In some embodiments, methods for providing determinism in multithreaded programs are provided, the methods comprising: instrumenting a program with: a proxy that: receives inputs to the program; and determines whether a schedule corresponding to a set of input constraints satisfied by the inputs has been memoized; and a replayer that: if it is determined that a schedule corresponding to a set of input constraints satisfied by the inputs has been memoized, processes the inputs by the program according to the schedule.
    Type: Grant
    Filed: July 25, 2011
    Date of Patent: September 27, 2016
    Assignee: The Trustees of Columbia University in the City of New York
    Inventors: Junfeng Yang, Heming Cui, Jingyue Wu
  • Patent number: 9449018
    Abstract: A method includes receiving, by a data processing apparatus, a plurality of file operation requests, each file operation request including a priority, a deadline, and an operation type and representing a request to perform an operation on at least one file maintained in a distributed file system; identifying, by the data processing apparatus, a group of file operation requests to be executed together from the plurality of file operation requests, the identification based at least in part on at least one of: the file operations in the group of file operations being directed to a same storage system, or file operations in the group of file operations sharing a common operation type; and sending a request to execute the group of file operation requests to a system configured to perform the group of file operation requests.
    Type: Grant
    Filed: November 25, 2013
    Date of Patent: September 20, 2016
    Assignee: Google Inc.
    Inventors: Chi Ma, Kenneth J. Goldman, Yonggang Zhao, Stephen P. G. Gildea
  • Patent number: 9430283
    Abstract: An information processing apparatus includes a storage unit and a processing unit. The storage unit is configured to store therein a first execution time and a second execution time longer than the first execution time. The first execution time is a time expected to be taken to execute a first job included in a first job group. The processing unit is configured to determine in which time period an execution start time of the first job is included. The execution start time is a time at which execution of the first job is to be started. The processing unit is configured to select, as a predicted execution time of the first job, one of the first execution time and the second execution time based on a result of the determination. The processing unit is configured to perform scheduling of the first job group based on the predicted execution time.
    Type: Grant
    Filed: June 13, 2014
    Date of Patent: August 30, 2016
    Assignee: FUJITSU LIMITED
    Inventors: Takashi Satoh, Tamotsu Sengoku, Hiroyuki Hatsushika, Yuuji Nomoto
  • Patent number: 9430282
    Abstract: Systems and methods are provided for processing a computing task divided into a plurality of discrete tasks using a plurality of data processors. The system includes a system memory having memory space for storing results from processed discrete tasks. The system further includes a plurality of data processors of differing types, a first data processor writing results to the system memory in a first format that is different from a second format that a second data processor uses to write results to the system memory. Further, a scheduler is configured to assign a first set of discrete tasks to the first data processor and a second set of discrete tasks to the second data processor so that a results writing conflict where the second data processor writes results to the system memory that overwrite results written to the system memory by the first data processor is avoided.
    Type: Grant
    Filed: October 1, 2013
    Date of Patent: August 30, 2016
    Assignee: MARVELL INTERNATIONAL, LTD.
    Inventors: Chuang-Yu Cheng, Chih-Hao Chang, Yi-Hsiu Hsu
  • Patent number: 9424108
    Abstract: Provided are techniques for launching and managing an unattended application program. The application program is launched in background mode. In response to determining that an exit command has been received, an exit command indicator is set to indicate that the exit command has been received and a notification is sent to wake up a blocked main thread of the launched application program.
    Type: Grant
    Filed: June 25, 2014
    Date of Patent: August 23, 2016
    Assignee: International Business Machines Corporation
    Inventors: Yong L. Li, Alan T Yaung
  • Patent number: 9424080
    Abstract: A multithreaded application that includes operations on a shared data structure may exploit futures to improve performance. For each operation that targets the shared data structure, a thread of the application may create a future and store it in a thread-local list of futures (under weak or medium futures linearizability policies) or in a shared queue of futures (under strong futures linearizability policies). Prior to a thread evaluating a future, type-specific optimizations may be performed on the list or queue of pending futures. For example, futures may be sorted temporally or by key, or multiple operations indicated in the futures may be combined or eliminated. During an evaluation of a future, a thread may compute the results of the operations indicated in one or more other futures. The order in which operations take effect and the optimization operations performed may be dependent on the futures linearizability policy.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: August 23, 2016
    Assignee: Oracle International Corporation
    Inventors: Alex Kogan, Maurice P. Herlihy
  • Patent number: 9424078
    Abstract: The preemption of running jobs by other running or queued jobs in a system that has processing resources. The system has running jobs, and queued jobs that are awaiting processing by the system. In a scheduling operation, preemptor jobs are identified, the preemptor jobs being jobs that are candidates for preempting one or more of the running jobs. The preemptor jobs include queued jobs, as well as running jobs that are capable of using more processing resource of the system. One of the other running jobs is preempted to free processing resources for the running job that was identified as a preemptor job. Accordingly, not only may queued jobs preempt running jobs, but currently running jobs may preempt other currently running jobs.
    Type: Grant
    Filed: November 14, 2011
    Date of Patent: August 23, 2016
    Inventors: Sayantan Chakravorty, Colin Watson, Christopher J. Crall
  • Patent number: 9426026
    Abstract: Computer implemented methods, system and apparatus for configuring a cluster using a plurality of hosts include identifying a plurality of features for forming the cluster. The plurality of features define requirements needed in a host for forming the cluster. A plurality of hosts are identified to be part of the cluster. A compatibility analysis is executed for each of the identified hosts. A plurality of suggested adjustments to particular hosts are presented to enable the particular hosts to be compatible with the features requirements. A configuration template is constructed for the hosts in the cluster that are compatible with the requirements. The hosts are configured for the cluster using the configuration settings in the configuration template. The configured hosts enable the features in the cluster.
    Type: Grant
    Filed: August 5, 2014
    Date of Patent: August 23, 2016
    Assignee: VMware, Inc.
    Inventor: Eric Rider
  • Patent number: 9417932
    Abstract: Provided are techniques for launching and managing an unattended application program. The application program is launched in background mode. In response to determining that an exit command has been received, an exit command indicator is set to indicate that the exit command has been received and a notification is sent to wake up a blocked main thread of the launched application program.
    Type: Grant
    Filed: October 28, 2013
    Date of Patent: August 16, 2016
    Assignee: International Business Machines Corporation
    Inventors: Yong L. Li, Alan T Yaung
  • Patent number: 9417882
    Abstract: There is provided a processor implemented method for controlling a lock-stepped cohort. The method includes receiving instructions for each of a first lane and a second lane. The first lane is for the lock-stepped cohort and the second lane is for another cohort. The method further includes detecting a condition in which a first instruction at the first lane will have a higher latency than a second instruction at the second lane. The method also includes setting an indicator indicating where the first lane encountered the first instruction. The method additionally includes setting the first lane to inactive, while keeping the second lane active. The method further includes setting the first lane to active on a subsequent opportunity to execute said first instruction.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: August 16, 2016
    Assignee: International Business Machines Corporation
    Inventors: Jose R. Brunheroto, Chen-Yong Cher, Hubertus Franke, Jamin Naghmouchi
  • Patent number: 9418024
    Abstract: An apparatus and method for efficient handling of critical chunks. For example, one embodiment of an apparatus comprises a plurality of agents to perform a respective plurality of data processing functions, at least one of the data processing functions comprising transmitting and receiving chunks of data to and from a memory controller, respectively; a system agent to coordinate requests for transmitting and receiving the chunks of data to and from the memory controller, the system agent comprising: a memory for temporarily storing the chunks of data during transmission between the agents and the memory controller; and scheduling logic to prioritize critical chunks over non-critical chunks across multiple outstanding requests while ensuring that the non-critical chunks do not result in starvation.
    Type: Grant
    Filed: September 27, 2013
    Date of Patent: August 16, 2016
    Assignee: Intel Corporation
    Inventors: Ahmad A. Samih, Shadi T. Khasawneh
  • Patent number: 9417918
    Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.
    Type: Grant
    Filed: November 20, 2013
    Date of Patent: August 16, 2016
    Assignee: International Business Machines Corporation
    Inventors: Alicia E. Chin, Yonggang Hu, Zhenhua Hu, Jason T S Lam, Zhimin Lin
  • Patent number: 9417935
    Abstract: A process scheduler for multi-core and many-core processors may place related executable elements that share common data on the same cores. When executed on a common core, sequential elements may store data in memory caches that are very quickly accessed, as opposed to main memory which may take many clock cycles to access the data. The sequential elements may be identified from messages passed between elements or other relationships that may link the elements. In one embodiment, a scheduling graph may be constructed that contains the executable elements and relationships between those elements. The scheduling graph may be traversed to identify related executable elements and a process scheduler may attempt to place consecutive or related executable elements on the same core so that commonly shared data may be retrieved from a memory cache rather than main memory.
    Type: Grant
    Filed: May 1, 2012
    Date of Patent: August 16, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Alexander G. Gounares, Charles D. Garrett
  • Patent number: 9417921
    Abstract: A method implemented in an electronic device serving as an orchestrator managing video and audio stream processing of a streaming platform system is disclosed. The method includes the electronic device receiving a request to process a video source and creating a task graph based on the request, where the task graph is a directed acyclic graph of tasks for processing the video source, where each node of the task graph represents a processing task, and where each edge of the task graph represents a data flow across two processing tasks and corresponding input and output of each processing task. The method also includes the electronic device estimating resource requirements of each processing tasks, and splitting the task graph into a plurality of subsets, wherein each subset corresponds to a task group to be executed by one or more workers of a plurality of processing units of the streaming platform system.
    Type: Grant
    Filed: July 31, 2014
    Date of Patent: August 16, 2016
    Assignee: iStreamPlanet Co.
    Inventors: Alessio Galdy, Sidharth Sapru
  • Patent number: 9411636
    Abstract: For multi-threaded network processing, a real-time task is scheduled in a network server by placing the task on a real-time task list, activating the task when an event occurs during operation of the network server, and executing the task when scanning the task list and finding that the task has been activated. For example, an application or kernel process sends to a real-time network thread manager a request to register a task specified by an address of a task service routine. The thread manager places the address in an entry on the task list and returns a cookie identifying the entry. Upon occurrence of the event, an interrupt routine sends to a task activation routine a request to activate the task specified by the cookie. At periodic intervals, if there are any activated tasks on the task list, then a real-time scheduler scans the task list.
    Type: Grant
    Filed: July 7, 2011
    Date of Patent: August 9, 2016
    Assignee: EMC Corporation
    Inventors: Dennis P. Ting, John A. Hassey, Robert E. Frazier, Ramanamurthy Jayanty, Daphna Nathanson
  • Patent number: 9405931
    Abstract: A protected stream manager includes one or more subsystems to receive a content stream in a virtual environment, obfuscate the content stream, and prioritize use of a processor to process the content stream.
    Type: Grant
    Filed: November 14, 2008
    Date of Patent: August 2, 2016
    Assignee: Dell Products L.P.
    Inventors: Shree Dandekar, David Konetski, Thomas Lanzoni
  • Patent number: 9407570
    Abstract: Various embodiments provide methods, apparatus, and systems for allocating content delivery network (CDN) volume. In an exemplary method, a business visit request can be received. Based on at least one of a time allocation strategy, a request number allocation strategy, and a regional allocation strategy, the business visit request can be dispatched to CDN servers for handling the business visit request.
    Type: Grant
    Filed: January 13, 2014
    Date of Patent: August 2, 2016
    Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
    Inventors: Xiaofeng Guo, Xianneng Zou, Xianfeng Mo
  • Patent number: 9400834
    Abstract: One embodiment of the present invention provides a computing system. The computing system includes a processor and a computer-readable storage medium. The computer-readable storage medium stores instructions which when executed by the processor cause the processor to perform a method. The method comprises assigning a vertex identifier of a first vertex to a second vertex in a graph based on an edge between the first vertex and the second vertex. The vertices represent elements in a data set, the edge represents a type and strength of relationship between the vertices. The method further comprises provisionally assigning each vertex to a vertex cluster associated with the vertex identifier, and converging the assignments based on a measure of cluster quality associated with all the vertex clusters. Each vertex cluster represents information of interest in the data set. One measure of clustering quality is called “modularity.
    Type: Grant
    Filed: December 6, 2013
    Date of Patent: July 26, 2016
    Assignee: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventor: Daniel Davies
  • Patent number: 9400963
    Abstract: Systems, methods and computer readable media are disclosed for prioritizing tasks associated with a group of users based on number of times the users have monitored the status of a task. In addition to the general system, systems, methods and computer readable media for task prioritizing, the tasks may be prioritized based on the number of users associated with a task, the importance of each user associated with a task, and the way the task was identified.
    Type: Grant
    Filed: July 8, 2014
    Date of Patent: July 26, 2016
    Assignee: United Services Automobile Association (USAA)
    Inventor: Randy R. Morlen
  • Patent number: 9400653
    Abstract: A data processing system and method of clearing and rebuilding dependencies, the data processing method including changing a counter associated with a first entry in response to selecting a second entry; comparing the counter with a threshold; and indicating that the first entry is ready to be selected in response to comparing the counter with the threshold; wherein the first entry is dependent on the second entry.
    Type: Grant
    Filed: March 14, 2013
    Date of Patent: July 26, 2016
    Assignee: SAMSUNG ELECTRONICS CO., LTD.
    Inventors: Ravi Iyengar, Sandeep Kumar Dubey
  • Patent number: 9396021
    Abstract: A technique for operating a high performance computing cluster includes monitoring workloads of multiple processors. The high performance computing cluster includes multiple nodes that each include two or more of the multiple processors. Workload information for the multiple processors is periodically updated in respective local job tables maintained in each of the multiple nodes. Based on the workload information in the respective local job tables, one or more threads are periodically moved to a different one of the multiple processors.
    Type: Grant
    Filed: December 16, 2008
    Date of Patent: July 19, 2016
    Assignee: International Business Machines Corporation
    Inventors: Lakshminarayana Baba Arimilli, Ravi Kumar Arimilli, Claude Basso, Jean L. Calvignac
  • Patent number: 9398069
    Abstract: A method for serving enterprise commerce between a stateless microkernel architecture HTTP server program executed on a server device and an HTTP client program executed on a client computing device is disclosed. The method includes receiving an HTTP request including a plurality of client attributes and a plurality of resource operations from an HTTP client program, reading the plurality of client attributes from the HTTP request, and splitting the HTTP request into a plurality of individual resource operations at a splitter/combiner agent.
    Type: Grant
    Filed: November 6, 2014
    Date of Patent: July 19, 2016
    Assignee: Elastic Path Software, Inc.
    Inventor: Matthew D. Bishop
  • Patent number: 9396114
    Abstract: A controller receives a request to perform staging or destaging operations with respect to an area of a cache. A determination is made as to whether more than a threshold number of discard scans are waiting to be performed. The controller avoids satisfying the request to perform the staging or the destaging operations or a read hit with respect to the area of the cache, in response to determining that more than the threshold number of discard scans are waiting to be performed.
    Type: Grant
    Filed: September 9, 2015
    Date of Patent: July 19, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael T. Benhase, Lokesh M. Gupta, Matthew J. Kalos