СИСТЕМА И СПОСОБ ДЛЯ УПРАВЛЕНИЯ СОСТОЯНИЕМ ОПЕРАТИВНОГО РЕЖИМА ПОСТАВЩИКА В РАСПРЕДЕЛЕННОЙ СЕТИ

Изобретение относится к системе управления связью между поставщиком и запросчиком в распределенной сети. Техническим результатом является повышение эффективности связи по сети. Способ описывает процесс управления связью между вычислительными устройствами поставщика и запросчика в распределенной сети. Вычислительное устройство запросчика предоставляет привязку отсроченного оперативного режима. Привязка отсроченного оперативного режима идентифицирует привязку, которая требуется запросчиком. Вычислительное устройство поставщика принимает привязку отсроченного оперативного режима от запросчика и продолжает предоставление привязки, так как поставщик стал осведомленным о привязке отсроченного оперативного режима. Система содержит технические средства поставщика и запросчика и сеть промежуточных узлов доступа. 3 н. и 8 з.п. ф-лы, 15 ил.

СПОСОБ СИНХРОНИЗАЦИИ ОБЪЕКТОВ ПЕРСОНАЛЬНОГО ИНФОРМАЦИОННОГО МЕНЕДЖЕРА И ВНЕШНЕГО СЕРВЕРА

Изобретения относятся к синхронизации данных. Технический результат заключается в обеспечении возможности синхронизации данных между Microsoft Outlook и внешним сервером с постоянным обновлением данных. Объекты, описывающие поток работ, хранятся в персональном информационном менеджере Microsoft Outlook в виде Объектов Outlook. Два непрерывных процесса проверяют, происходят ли изменения в Объектах Outlook и сохраняются ли эти изменения. Объекты хранения MICROSOFT используются для хранения информации об измененных полях Объектов Outlook в оперативной памяти компьютера и полях Объектов Outlook, которые были сохранены на жесткий диск. Информация об измененных и сохраненных полях отправляется на внешний сервер. Впоследствии получается уведомление об успешном сохранении полей на внешнем сервере. Получается информация об изменении поля на внешнем сервере. Измененные на внешнем сервере поля сохраняются в Объекты Microsoft Outlook. 3 н. и 12 з.п. ф-лы, 8 ил.

КОМАНДА НА НЕТРАНЗАКЦИОННОЕ СОХРАНЕНИЕ

Изобретение относится к области транзакционной обработки внутри многопроцессорных вычислительных сред. Техническим результатом является повышение эффективности отладки сброшенной транзакции. Предложены способ выполнения команды внутри вычислительной среды, а также машиночитаемый носитель информации и компьютерная система, с помощью которых осуществляется указанный способ. Способ включает получение процессором машинной команды для выполнения, причем указанная машинная команда определяется для выполнения компьютером в соответствии с архитектурой компьютера, указанная машинная команда включает: код операции для определения нетранзакционной операции сохранения; первый операнд и второй операнд для указания позиции для первого операнда; и выполнение процессором машинной команды, причем указанное выполнение включает: нетранзакционное размещение первого операнда в позиции, указанной вторым операндом, причем информация, хранящаяся во втором операнде, остается несмотря на сброс транзакции, связанной ...

СИСТЕМА И СПОСОБ НАЗНАЧЕНИЯ КОЭФФИЦИЕНТА, ОСНОВАННОГО НА ВЕКТОРЕ ПОСТОЯНСТВА

Изобретение относится к распределению ограниченного ресурса между многочисленными пользователями. Технический результат заключается в делении предполагаемой емкости ресурса на ряд распределений с фиксированным коэффициентом для обеспечения оптимального использования разделяемого ресурса. В системе, включающей в себя ресурс, используемый совместно, осуществляют управление коэффициентами загрузки ресурса пользователями с учетом векторов постоянства, характеризующих вероятность использования ресурса тем или иным пользователем. Указанное управление позволяет исключить ситуации, когда происходит перегрузка ресурса. Описаны система и способ, в которых коэффициенты загрузки выбираются из множества доступных коэффициентов в соответствии со множеством векторов постоянства пользователей совместно используемого ресурса. 5 н. и 42 з.п. ф-лы, 4 ил.

ВЫПОЛНЕНИЕ ВЫНУЖДЕННОЙ ТРАНЗАКЦИИ

Группа изобретений относится к обработке транзакций в вычислительной среде. Технический результат заключается в повышении быстродействия обработки за счет корректирующего действия, основанного на определении ситуации. Предлагается обработка вынужденной транзакции, которая может быть инициирована выполнением команды Начать Транзакцию вынужденно. Вынужденная транзакция имеет ряд ограничений, связанных с нею. При отсутствии нарушений ограничений, указанная вынужденная транзакция завершается. В случае обнаружения ситуации сброса, указанная транзакция повторно выполняется начиная с команды Начать Транзакцию. Нарушение ограничений может привести к прерыванию. 2 н. и 15 з.п. ф-лы, 27 ил.

ВЫСОКОСКОРОСТНОЕ УПРАВЛЕНИЕ БЛОКИРОВКАМИ ДЛЯ МГНОВЕННОГО КОПИРОВАНИЯ В СИСТЕМАХ ХРАНЕНИЯ ДАННЫХ С СОВМЕСТНЫМ ИСПОЛЬЗОВАНИЕМ ПАМЯТИ N УЗЛАМИ

Изобретение относится к вычислительным устройствам для управления памятью, в частности к контроллерам внешней памяти. Техническим результатом является расширение функциональных возможностей. Устройство управления памятью для работы в сети контроллеров памяти содержит контроллер памяти, являющийся узлом-владельцем, способным управлять блокировкой определенной области данных при выполнении операций ввода-вывода, и компонент для обмена сообщениями, обеспечивающий передачу по меньшей мере одного сообщения с запросом блокировки, разрешением блокировки, запросом снятия блокировки и сигналом снятия блокировки, а также компонент ввода-вывода, причем любой образ указанной области данных, полученный путем мгновенного копирования последней, поддерживается когерентным по отношению к самой области данных, а компонент ввода-вывода может помещать в кэш-память предыдущее прямое подтверждение, что эта область данных осталась когерентной любому такому образу, и выполнять операции ввода-вывода на основе этого ...

РАВНОПРАВНОЕ РАЗДЕЛЕНИЕ СИСТЕМНЫХ РЕСУРСОВ В ИСПОЛНЕНИИ РАБОЧЕГО ПРОЦЕССА

Способ может быть применен на практике в распределенном вычислительном окружении, которое предоставляет вычислительные ресурсы множеству арендаторов. Технический результат заключается в предотвращении запуска рабочих нагрузок, превышающих некоторую продолжительность. Способ включает в себя действия для выделения ограниченного множества системных ресурсов арендаторам. Способ включает в себя идентификацию части ресурса. Способ дополнительно включает в себя идентификацию выполняющейся рабочей нагрузки арендатора. Характеристики контрольных точек идентифицируются для исполняющейся рабочей нагрузки арендатора. На основе характеристик контрольных точек и части ресурса идентифицируется событие вытеснения задачи. 3 н. и 17 з.п. ф-лы, 6 ил.

СИСТЕМА УПРАВЛЕНИЯ ТЕХНОЛОГИЧЕСКИМ ПРОЦЕССОМ, ПЕРИФЕРИЙНОЕ УСТРОЙСТВО ДЛЯ ИСПОЛЬЗОВАНИЯ В НЕЙ (ВАРИАНТЫ) И СПОСОБ ПЛАНИРОВАНИЯ ДЕЙСТВИЙ

Изобретение относится к технологическим процессам. Периферийное устройство для использования в системе управления технологическим процессом содержит процессор; память; функциональный блок для инициализации запланированных действий и модуль планирования. Процессор получает введенное время и действие от главного устройства, подключенного через каналы передачи данных к периферийному устройству. Введенное время и действие указывает на запланированное время выполнения запланированного действия или последовательности действий. В запланированное время и без дополнительной передачи данных от главного устройства, автоматически выполняют запланированное действие или последовательность действий. Формируют состояние инициализации, которое передается на главное устройство, и состояние инициализации, которое сохраняется в локальной памяти периферийного устройства. Состояние инициализации указывает на выполнение процесса инициализации действия или последовательности действий. Сокращается время обмена ...

ПЛАТФОРМА "ФУНКЦИЯ-КАК-УСЛУГА" (FaaS) В БЛОКЧЕЙН СЕТЯХ

Изобретение относится к способу, считываемому компьютером носителю данных и системе для предоставления платформы "функция-как-услуга" (FaaS) в блокчейн сети. Технический результат заключается в автоматическом выполнении узлом блокчейн сети транзакции, использующей смарт-контракт. В способе принимают из смарт-контракта и посредством первого приложения функции, содержащего первый контроллер функции, выполняемый в блокчейн сети, вызов первой функции, содержащий данные для выполнения первой функции, выполняемой посредством кода в первом приложении функции, содержащем множество версий первой функции, первый контроллер функции маршрутизирует вызов первой функции в соответствующую версию первой функции, при этом первое приложение функции хранится в блокчейн сети, первый контроллер функции имеет уникальный адрес в блокчейн сети, и каждая из версий первой функции имеет соответствующий уникальный адрес в блокчейн сети; посредством первого контроллера функции передают данные вызова первой функции ...

МНОГОКАНАЛЬНОЕ УСТРОЙСТВО ПРИОРИТЕТА

Многоканальное устройство приоритета, содержащее распределитель импульсов, элемент ИЛИ, а в каждом канале триггер и два элемента И, причем выход первого элемента И канала соединен с единичным входом триггера канала, нулевой вход которого соединен с выходом второго элемента И канала, выход элемента ИЛИ соединен со входом распределителя импульсов, выход триггера канала соединен с первым входом второго элемента И канала, второй вход второго элемента И канала соединен с соответствующим выходом группы выходов распределителя импульсов, второй вход первого элемента И канала соединен с соответствующим запросным входом устройства, выходы триггеров каналов соединены с входами элемента ИЛИ, выход распределителя импульсов является выходом устройства, причем распределитель импульсов содержит счетчик, дешифратор, элемент И и генератор импульсов, выходы счетчика через дешифратор соединены с группой выходов распределителя импульсов, выход генератора импульсов и вход распределителя импульсов через элемент ...

СИСТЕМА ДИНАМИЧЕСКОГО АРБИТРАЖА СОВМЕСТНО ИСПОЛЬЗУЕМОГО РЕСУРСА В УСТРОЙСТВЕ

... 1. Способ осуществления арбитража выделения ресурса устройства в устройстве, содержащий этапы, на которыхпринимают запрос от запрашивающего приложения, которое запрашивает выделение ресурса устройства,определяют, что этим ресурсом устройства владеет владеющее приложение,ассоциируют информацию владельца с информацией запрашивающей стороны, чтобы сформировать запрос на арбитраж, причем информация владельца содержит информацию о владеющем приложении и информация запрашивающей стороны содержит информацию о запрашивающем приложении,осуществляют арбитраж в отношении запроса на арбитраж для выработки решения арбитража, которое указывает, должен ли ресурс устройства быть выделен запрашивающему приложению или нет ивыделяют ресурс устройства на основании решения арбитража.2. Способ по п.1, в котором этап осуществления арбитража выполняют с помощью средства арбитража ресурсов, при этом способ содержит этап, на котором загружают средство арбитража ресурсов в устройство.3. Способ по п.1, в котором информация ...

УСТРОЙСТВО ОБРАБОТКИ ИНФОРМАЦИИ, СПОСОБ ОБРАБОТКИ ИНФОРМАЦИИ И ПРОГРАММА

... 1. Устройство обработки информации, содержащеемножество каркасов приложений, на которых выполняются приложения; иблок принятия решений, выполненный с возможностью управлять переключением рабочих состояний множества каркасов приложений.2. Устройство обработки информации по п. 1, в котором блок принятия решений управляет переключением рабочих состояний множества каркасов приложений на основании команды из приложения, выполняемое на выбранном одном из множества каркасов приложений.3. Устройство обработки информации по п. 2, дополнительно содержащее блок переключения процесса, выполненный с возможностью переключать активированное приложение на приложение, выполняемое на выбранном одном из множества каркасов приложений.4. Устройство обработки информации по п. 3, в котором блок переключения процесса дополнительно выполнен с возможностью останавливать работу текущего активированного приложения и начинать работу приложения, выполняемое на выбранном одном из множества каркасов приложений.5. Устройство ...

СЕТЕВАЯ ВЫЧИСЛИТЕЛЬНАЯ СИСТЕМА

... 1. Сетевая вычислительная система, предназначенная для выполнения вычислительной задачи и содержащая: ! модуль распределения множества алгоритмов случайным образом среди множества устройств обработки информации, причем обеспечивается возможность изменения алгоритмов во времени; ! модуль выбора одного или нескольких измененных алгоритмов в соответствии с заданным условием; и ! модуль применения выбранного одного или нескольких алгоритмов для выполнения вычислительной задачи, которая представляет собой финансовый алгоритм. ! 2. Сетевая вычислительная система по п.1, содержащая дополнительно модуль поддержания уровня вознаграждения для каждого из множества устройств обработки информации. ! 3. Сетевая вычислительная система по п.1, в которой по меньшей мере одно устройство обработки информации содержит группу центральных процессоров. ! 4. Сетевая вычислительная система по п.1, в которой по меньшей мере одно вознаграждение представляет собой денежное вознаграждение. ! 5. Сетевая вычислительная ...

МЕХАНИЗМ ОБРАБОТКИ ПРЕРЫВАНИЙ В КОМПЬЮТЕРНЫХ СИСТЕМАХ, ПОДДЕРЖИВАЮЩИХ ОДНОВРЕМЕННОЕ ИСПОЛНЕНИЕ МНОЖЕСТВА ПОТОКОВ

... 1. Процессор, содержащий первый блок обработки прерываний для предписывания первому логическому процессору выполнить подпрограмму обработки прерываний в ответ на прерывание; второй блок обработки прерываний для предписывания второму логическому процессору выполнить подпрограмму обработки прерываний в ответ на прерывание; и регистр заявок на прерывания для хранения значения, которое показывает, должны ли первый и второй логические процессоры обрабатывать прерывание. 2. Процессор по п.1, в котором первый и второй логические процессоры считывают значение из регистра заявок на прерывания под управлением подпрограммы обработки прерываний. 3. Процессор по п.2, в котором первый логический процессор обрабатывает прерывание, если он первым считывает регистр заявок на прерывания. 4. Процессор по п.2, в котором второй логический процессор завершает подпрограмму обработки прерываний, если первый логический процессор обрабатывает прерывание. 5. Процессор по п.4, в котором второй логический процессор ...

ИТЕРАЦИОННОЕ АРИФМЕТИКО-ЛОГИЧЕСКОЕ УСТРОЙСТВО С КОНТРОЛИРУЕМОЙ ТОЧНОСТЬЮ

... 1. Способ выполнения итерационной арифметической операции в процессоре, содержащий этапы, на которых ! итерационно обрабатывают операнды первой точности для получения результата; и ! завершают итерационную обработку, когда результат достигает запрограммированной второй точности, меньшей, чем первая точность. ! 2. Способ по п.1, дополнительно содержащий этап, на котором заполняют результат так, что заполненный результат имеет битовую ширину, соответствующую первой точности. ! 3. Способ по п.2, в котором этап, на котором заполняют результат так, что заполненный результат имеет битовую ширину, соответствующую первой точности, содержит этап, на котором добавляют один или более битов логических нулей к результату. ! 4. Способ по п.1, дополнительно содержащий этап, на котором хранят результат в регистре, имеющем битовую ширину меньшую, чем первая точность. ! 5. Способ по п.1, дополнительно содержащий этап, на котором отбрасывают один или более наименее значащих бит (LSB) операндов перед началом ...

СПОСОБ ОПРЕДЕЛЕНИЯ ПРИОРИТЕТА ЗАДАЧ, НАХОДЯЩИХСЯ В ОЧЕРЕДИ СЕРВЕРНОЙ СИСТЕМЫ

... 1. Способ определения приоритета множества задач от множества пользователей, по меньшей мере, для одного процессора, содержащий, применительно к необработанной задаче одного пользователя из множества пользователей,назначение числового приоритета пользователю;вычисление монотонной метрики M1 по совокупному процессорному времени, использованному предыдущими задачами пользователя, по меньшей мере, на одном процессоре за предшествующий период времени Т1;вычисление монотонной метрики М2 по временному интервалу между необработанной задачей и предшествующей задачей пользователя, по меньшей мере, на одном процессоре за предшествующий период времени Т2;вычисление монотонной метрики M3 по совокупному объему задач пользователя, по меньшей мере, на одном процессоре за предшествующий период времени Т3;уменьшение числового приоритета пользователя монотонно зависящего от значений M1, М2 и M3; иназначение числового приоритета пользователя необработанной задаче;причем необработанные задачи с более высокими ...

ДОСТИЖЕНИЕ КОНСЕНУСА МЕЖДУ СЕТЕВЫВЫМИ УЗЛАМИ В РАСПРЕДЕЛЕННОЙ СИСТЕМЕ

Изобретение относится к области технологий передачи данных в распределенных системах. Техническим результатом является расширение арсенала средств для увеличения эффективности достижения консенсуса между множеством сетевых узлов в цепочке блоков. Технический результат предложенного технического решения достигается за счет того, что выполняются этапы, на которых выполняют прием запроса транзакции первичным узлом, отправку первичным узлом некоторого количества первых сообщений резервным узлам, прием первичным узлом вторых сообщений от резервных узлов, восстановление запроса транзакции на основе данных во вторых сообщениях посредством первичного узла, отправку третьего сообщения резервным узлам посредством первичного узла и выполнение запроса транзакции в ответ на прием предопределенного количества третьих сообщений. 6 н. и 51 з.п. ф-лы, 17 ил.

СОВМЕСТНОЕ ИСПОЛЬЗОВАНИЕ СЕКРЕТОВ БЕЗ ДОВЕРЕННОГО ИНИЦИАЛИЗАТОРА

Изобретение относится к средствам обновления данных пользовательских признаков. Технический результат заключается в улучшении прогнозирования потребности пользователей и обеспечении предоставления адресных рекомендаций для пользователей. Идентифицируют, посредством платформы рейтинга и рекомендаций по изделиям, данные рейтингов, содержащие соответствующие рейтинги множества изделий от множества пользователей. Идентифицируют, посредством платформы рейтинга и рекомендаций по изделиям, данные пользовательских признаков, содержащие множество пользовательских признаков, оказывающих влияние на соответствующие рейтинги множества изделий от множества пользователей. Принимают, из социальной сетевой платформы посредством платформы рейтинга и рекомендаций по изделиям через схему совместного использования секретов без доверенного инициализатора, множество манипулированных данных социальных сетей, вычисленных на основе данных социальных сетей и первого числа случайных переменных. При этом данные социальных ...

ЭФФЕКТИВНАЯ МАРШРУТИЗАЦИЯ ПРЕРЫВАНИЙ ДЛЯ МНОГОПОТОЧНОГО ПРОЦЕССА

СПОСОБ И СИСТЕМА УПРАВЛЕНИЯ МНОЖЕСТВЕННЫМ ВВОДОМ И ЭЛЕКТРОННОЕ УСТРОЙСТВО, ПОДДЕРЖИВАЮЩЕЕ ТО ЖЕ САМОЕ

Модуль системы сбора информации геолого-технологических исследований

Изобретение относится к области нефтяной и газовой промышленности, а именно к системам мониторинга при строительстве и ремонте нефтегазовых скважин для выполнения опроса технологических параметров. Модуль системы сбора информации геолого-технологических исследований содержит модуль 3 связи с ЭВМ с программным обеспечением системы сбора информации, связанный линиями связи с технологическими устройствами, и модуль 5 хранения информации о технологических устройствах. Согласно изобретению он включает модуль 8 коммутации пакетов протокола SenNet, связанный двунаправленным программным интерфейсом с модулем 1 обработки команд протокола SenNet, модулем 3 связи с ЭВМ для приема/передачи пакета протокола SenNet, модулем 2 коммутации пакетов протокола SenNet по линиям связи и модулем 4 виртуальных устройств. Модуль 1 обработки команд протокола SenNet и модуль 4 виртуальных устройств связаны с модулем 5 хранения информации о технологических устройствах, который в свою очередь подключен через модуль ...

Gerät und Verfahren zur Durchführung einer anwendungsbestimmten Operation auf Daten als Teil einer systembestimmten Operation auf die Daten

Virtuelles Rechnersystem.

Vorrichtung und Verfahren zur Steuerung von asynchronen Programmunterbrechungserreignissen in einem Datenverarbeitungssystem.

Optimierung der SMI-Handhabung und -Initialisierung

Verfahren, umfassend: Empfangen eines ersten Systemverwaltungsinterrupts (SMI); Behandeln des ersten SMIs mit einem ersten Prozessor; Erzeugen eines Wake-Up-Signals mit dem ersten Prozessor; Erwecken eines zweiten Prozessors, basierend auf dem Wake-Up-Signal vom ersten Prozessor; und Behandeln des ersten SMIs mit einem zweiten Prozessor.

Gleichzeitige Ausführung einer Anforderungsverarbeitung und von Analysen von Anforderungen

Eine Anforderungsverarbeitung innerhalb einer Computerumgebung wird vereinfacht. Eine Anforderungsverarbeitung und eine analytische Verarbeitung für die Anforderung werden im Wesentlichen gleichzeitig durchgeführt, um die Wirksamkeit der Anforderungsverarbeitung zu verbessern. Vor einem Empfangen einer Anzeige von Erfolg oder Fehlschlag der Anforderungsverarbeitung wird die analytische Verarbeitung zumindest begonnen und kann abgeschlossen werden. Wenn die Anforderungsverarbeitung fehlschlägt, endet die analytische Verarbeitung, wenn sie noch nicht abgeschlossen ist, und Ergebnisse der analytischen Verarbeitung werden nicht verwendet.

Auswählen eines Hosts für eine virtuelle Maschine unter Verwendung einers Hardware-Multithreading-Parameters

Ein Cloud-Manager überwacht verfügbare Ressourcen auf Host-Computersystemen einschließlich einer Anzahl von Hardware-Threads, die durch CPUs auf den Host-Computersystemen unterstützt werden. Der Cloud-Manager empfängt eine Anforderung zum Bereitstellen einer virtuellen Maschine (VM), die einen Hardware-Multithreading-Parameter enthält, der das Ausmaß von Hardware-Multithreading angibt, das auf dem Host-Computersystem erforderlich ist. Der Cloud-Manager wählt anschließend ein Host-Computersystem für die VM aus und berücksichtigt hierbei den Hardware-Multithreading-Parameter.

Nachrichten-Warteschlangensystem für eine parallel integrierte Schaltkreisarchitektur und zugehöriges Betriebsverfahren

Integrierter Schaltkreis, der auf einen externen Speicher zugreift, aufweisend: a) einen Steuerprozessor; b) eine Mehrzahl von parallel geschalteten Vektorverarbeitungs-Engines (VPEs) (205), wobei jede der VPEs (205) aufweist: b1) eine Mehrzahl von Vektorverarbeitungs-Einheiten (VPUs) (207), wobei jede VPU eine Datenverarbeitungseinheit zum Ausführen mathematischer/logischer Operationen, einen lokalen Speicher (501) aufweisend einen Anweisungs- und einen Datenspeicher aufweist, b2) eine Mehrzahl von VPU-Steuereinheiten (VCUs) (206), wobei jede VCU ebenfalls einen lokalen Speicher (502) aufweisend einen Anweisungs- und einen Datenspeicher aufweist und funktionelle Aspekte der Gesamt-Speichersteuerfunktion implementiert, b3) einen Zwischenspeicher ISM (505), der im Vergleich zu den lokalen Speichern große Mengen von Daten speichern kann, b4) eine Direct Memory Access (DMA)-Steuerung (503), die angepasst ist, um Datenübertragungen zwischen jedem der Speicher (501, 502, 505) in der VPE und ...

Bedingungsregister fuer eine programmgesteuerte Datenverarbeitungsanlage

Reservierung voon Ressourcen für erwartete Arbeitseinheiten anhand von simulierten Arbeitseinheiten

Unterbrechung von Aufgaben zur Verwatlung von Chip-Komponenten

Die Erfindung stellt einen IC-Chip (102) bereit, aufweisend ein Servicemodul (104), das so ausgelegt ist, dass eine oder mehrere Komponenten (114, 116, 118, 120) des Chips über eine oder mehrere Aufgaben (T1 bis T5) verwaltet werden, wobei das Servicemodul aufweist: ein Verarbeitungsmodul (106); einen Datenspeicher (112), auf dem ein gegenwärtiger Zustand (CS) einer gegenwärtig ausgeführten (T4) der Aufgaben gespeichert ist; eine Schnittstelle (122) zum Empfangen einer Anforderung (R), um eine weitere (T1) der Aufgaben auszuführen, wobei die gegenwärtig ausgeführte Aufgabe (T4) eine erste Priorität (P4) aufweist und die andere Aufgabe (T1) eine zweite Priorität (P1) aufweist; einen Taktgeber (108), der zum Messen eines Zeitintervalls ausgelegt ist, das zwischen dem Empfangen der Anforderung und der aktuellen Uhrzeit vergangen ist; ein Steuermodul, das so ausgelegt ist, dass die gegenwärtig ausgeführte Aufgabe unterbrochen und die Ausführung der angeforderten Aufgabe ausgelöst wird, falls ...

VERFAHREN UND VORRICHTUNG FÜR ANWENDUNGS- UND DELEGIERUNGSPAKETE

VERFAHREN UND VORRICHTUNG ZUR ASYNCHRONEN BERICHTENÜBERTRAGUNG

Datenverarbeitungsverwaltungsvorrichtung, Modusverwaltungsvorrichtung und Modusverwaltungsverfahren

SPEICHERSCHNITTSTELLE FÜR SYSTEME MIT MEHREREN PROZESSOREN UND EINEM SPEICHERSYSTEM

Starten eines sicheren Kernels in einem Multiprozessorsystem

Eine Ausführungsform dieser Erfindung umfaßt ein Verfahren, das Überprüfen eines einleitenden logischen Prozessors von einem System; Validieren eines Trusted Agents mit dem einleitenden logischen Prozessor, wenn der einleitende logische Prozessor geprüft ist; und Starten des Trusted Agents auf mehreren Prozessoren des Systems, wenn der Trusted Agent validiert ist. Nach der Ausführung eines solchen Trusted Agents, kann dann an bestimmten Ausführungsformen ein sicherer Kernel gestartet werden. Das System kann zum Beispiel ein Multiprozessorserversystem sein, das eine teilweise oder vollständig verbundene Technologie mit beliebigen Punkt-zu-Punkt-Zwischenverbindungen hat.

Computer system, computer system management method and prograam

Selecting a host for a virtual machine using hardware multithreading parameter

Methods and systems for delegating work objects across a mixed computer environment

Computer system and control method for computer system

Object-based data processing system using non-standard names

An object-based data processing system, such as a node for a telecommunications system, has data processing hardware which is capable of performing a plurality of possible functions. Each function is controlled by a respective software object. The object receives instructions to perform the function through interface means (to which the instructions are passed from, for example, an operation zone maintenance centre), and has a respective distinguishing name which is determined in accordance with an interface standard (such as is laid down by ETSI), and which is required in the instructions to that object, wherein the system includes a further software object for causing an additional function to be performed, the further object having a non-standard name which is not revealed in any scoping or searching of the system, or any wildcard addressing thereof. The further software object allows the option for additional functions to be provided by the system, whilst ensuring that the system still ...

Launching a secure kernel in a multiprocessor system

User-level data storage system

Method and apparatus for performing adjustable precision exception handling

Memory consistency protection in a multiprocessor computing system

System and Method for Reducing Execution Divergence in Paralle Processing Architectures

A method for reducing execution divergence among a plurality of threads executable within a parallel processing architecture (eg SIMD) includes an operation of determining, among a plurality of data sets (410) that function as operands for a plurality of different execution commands, a preferred execution type for the collective plurality of data sets. A data set is assigned from a data set pool to a thread (434) which, is to be executed by the parallel processing architecture, the assigned data set being of the preferred execution type, whereby the parallel processing architecture is operable to concurrently execute a plurality of threads, the plurality of concurrently executable threads including the thread having the assigned data set. An execution command (436) for which the assigned data functions as an operand is applied to each of the plurality of threads. The pool may comprise local memory storage (412 & 414). If one of the plurality of threads has terminated the data set may be ...

Detecting malware by monitoring executed processes

The invention provides for the detection of malware by monitoring executed processes using a dedicated monitoring device 13, the monitoring being performed without the support of an operating system 15 of hardware 11. The monitoring device 13 comprises a retrieval module 131 configured to retrieve entry point information 112 of a process 150 from a CPU 111 before the process is executed, the process comprising at least one instruction (150a,b,c), and an analysis module 133 configured to retrieve an address 110 corresponding to the process from the CPU according to the entry point information, the address corresponding to a memory block where the at least one instruction is stored. Once execution of the process commences, the monitoring device records the instructions in a memory 113 of the hardware. During or after execution, a determination module 137 of the monitoring device retrieves the executed instructions from the memory and compares them with a malicious process behaviour model ...

Security management system in a parallel processing system

A method of operating a computer device through the use of extensible thread states

A personality layer running above an operating system kernel puts any threads that the personality layer is responsible for into new states which the kernel does not know about. This prevents the kernel from performing operations on a thread which has been placed in one of these new states where these operations are sensitive to state of the thread itself (such as kill, suspend, change priority). Instead, the kernel redirects these thread operations to a handler in the personality layer which then handles the operation. The kernel is thus, in essence, extensible through the use of the added personality layers, and it can therefore be used to run legacy real-time applications written for other real-time operating systems.

Computer system and computer system control method

This computer system has a computer subsystem. The computer subsystem includes physical resources as the basis for both a virtual server serving as a virtual server device and a virtual storage serving as a virtual storage device. That is, some of the physical resources are allocated to the virtual server, and some other physical resources are allocated to the virtual storage. Any portions of the physical resources can be allocated to either of the virtual server and virtual storage.

Mechanism for interrupt handling in computer systems that support concurrent execution of multiple threads

Hidden automated data mirroring for native interfaces in distributed virtual machines

An initial request for a reference to a data container is sent from a distributed enhanced remote execution container native interface component of a distributed virtual machine to a distributed enhanced virtual machine native interface component of the distributed virtual machine in response to receipt of the initial request from a remote execution container. A data mirror data structure including immutable data and the reference to the data container is received. The received data mirror data structure including the immutable data and the reference to the data container is stored within a local memory storage area. A reference to the locally-stored data mirror data structure is returned to the remote execution container in response to the initial request for the reference to the data container.

A multithreaded processor capable of implicit multithreaded execution of a single-thread program

Multi-tenant data service in distributed file systems for big data analysis

Improvements relating to arithmetic and logic units

... 1,045,425. Electric digital calculators. INTERNATIONAL BUSINESS MACHINES CORPORATION. March 1, 1965 [April 6, 1964], No. 8602/65. Heading G4A. An arithmetic and logic unit (ALU) produces a result word by operating in parallel simultaneously on first and second multidigit binary operands and has unified circuitry selectively operable to perform in one pass through the unit addition or subtraction of the operands or logical connective operations (e.g. AND, OR, EXCL-OR) on like-ordered digits of the respective operands. The operation performed is selected by control signal inputs to the logic circuitry constituting the ALU. Each operand has 8 bits which may be part of a larger operand, the parts of which are dealt with successively. The 8 bits may be purebinary-coded or constitute two binary-codeddecimal (BCD) digits. The two 4-bit halves of one of the operands may be interchanged and/or either half eliminated during transfer to the ALU. The other operand may be complemented (for subtraction ...

Efficient task scheduling using locking mechanism

A data processing apparatus and method for performing lock-protected processing operations for multiple threads

Processing circuitry 10 performs processing operations required by a plurality of threads 17, 18, 19, the processing operations including a lock-protected processing operation with which a lock 55 is associated, where the lock needs to be acquired before the processing circuitry performs the lock-protected processing operation. Baton maintenance circuitry 35 is used to maintain a baton in association with the plurality of threads, the baton forming a proxy for the lock, and the baton maintenance circuitry being configured to allocate the baton between the threads. Via communication between the processing circuitry and the baton maintenance circuitry, once the lock has been acquired for one of the threads, the processing circuitry performs the lock protected processing operation for multiple threads before the lock is released, with the baton maintenance circuitry identifying a current thread amongst the multiple threads for which the lock-protected processing operation is to be performed ...

Distributed computer system

Application load adaptive multi-stage parallel data processing architecture

Computer system

Method and apparatus for battery charge monitoring

Context-aware permission control of hybrid mobile applications

Processor and method for persisting cache lines or data changes of non-transactional software processes

Spark-based imaging satellite task preprocessing parallelization method

Spark (RTM) based imaging satellite task preprocessing parallelization method includes: 101 performing orbit prediction parallelization design and decomposing a large-scale observation task into multiple small tasks, each small task being completed independently; and 102 implementing parallelized orbit prediction. Orbit prediction inputs of multiple satellites may be obtained, encapsulated into an RDD and output via an orbit prediction program. Elements in the RDD may be transmitted to the orbit prediction program by means of pipe. An output result from orbit prediction computing of each satellite in each computing time segment may be obtained and an orbit identification parameter may be used to distinguish between output results. Output results storage manner may be writing into a local file system, RDD or Redis (RTM) memory. Spark (RTM) cluster environment may be initialised and a cluster parameter may be configured. Preprocessing may be used in large‐scale satellite observation task ...

MULTI-MODE MICROPROCESSOR WITH ELECTRICAL PIN FOR SELECTIVE REINITIALIZATION OF PROCESSOR STATE

Launching a secure kernel in a multiprocessor system

Microservices change management and analytics

Managing microservice changes and performing related analytics can include generating a plurality if process instance representations. Each process instancere presentation can be generated based on a corresponding process path that comprises an ordered sequence of operations that are performed by a process using multiple microservices. a microservices network representation can be constructed based on the plurality of process instance representations, each element of the microservices network corresponding to an interface between a pair of the microservices. Based on the microservices network representation, a relative frequency can be determined for each of the microservices, each relative frequency corresponding to a likelihood that a change in a microservice will affect the performance of at least one process using at least one of the microservices.

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

MEMORY INTERFACE FOR SYSTEMS WITH SEVERAL PROCESSORS AND A MEMORY SYSTEM

ACCESS RESTRICTION ON OBJECTS FOR APPLICATION SERVERS IN DISTRIBUTED COMPUTER SYSTEMS

SYSTEM AND PROCEDURE FOR THE FAST CORRELATION A REFERENCE-COUNTED OF AN OBJECT

BOLTING DEVICE ADMINISTRATION WITH HIGH EFFICIENCY FOR FLASH COPY IN N-MULTIPLE COMMON USED MEMORY SYSTEMS

PROCEDURE AND DEVICE FOR THE MULTIPLE PROCESSING EXECUTION OF INSTRUCTIONS FOR COMPUTER

SYSTEM AND PROCEDURE FOR THE STABILITY-VECTOR-BASED CHANGE OF THE USE FREQUENCY

DATA PROCESSING SYSTEM AND - PROCEDURES

PROJECTION OF TRUSTWORTHINESS OF A RELIABLE ENVIRONMENT ON AN UNRELIABLE ENVIRONMENT

AUDIO DEVICE

PROCEDURES AND SYSTEM FOR PRODUCING FROM INSTRUCTION SIGNALS TO WOULD DRIVE THROUGH EQUIVALENT COMPUTER PROGRAMME PRODUCT FROM INTERFERENCES IN A COMMUNICATIONS NETWORK AND

INTEGRATED DATA PROCESSING CIRCUIT WITH SEVERAL PROGRAMMABLE PROCESSORS

SYSTEM WITH SEVERAL PROCESSORS AND PROCEDURE FOR ITS ENTERPRISE

ORGANIZATION OF THE MEMORY ACCESS BETWEEN SEVERAL PROCESSORS

ARRANGEMENT FOR DISTRIBUTING THE PRIORITY BETWEEN TWO COMPUTERS.

PROCESS BARRIER FOR DATA PROCESSING SYSTEM WITH PROGRAM TEETH.

ARRANGEMENT FOR ON COMPONENTS WAS BASED EXECUTION OF TASKS DURING THE TREATMENT OF INSURANCE CLAIMS

PROCEDURE AND DEVICE FOR CLIENT-ADMINISTERED FLOW CONTROL IN A COMPUTER SYSTEM WITH LIMITED MEMORY

COMPUTER SYSTEM WITH SOFTWARE INTERRUPTION INSTRUCTIONS, WHICH WORKS SELECTIVELY IN A VIRTUAL MODE

Microprogram-controlled data-processing system

DEVICE AND PROCEDURE FOR THE DETERMINATION OF A PROGRAM NEIGHBOURHOOD FOR A CUSTOMER KNOT IN A CUSTOMER OPERATOR NETWORK

TECHNIQUES FOR GRANTING THE ACCESS BY A CONTEXT BARRIER IN EQUIPMENT WITH SMALL SPACE REQUIREMENT USING AN OBJECT OF POINT OF ENTRANCE

TECHNIQUES FOR PERMITTING ENTRANCE BY A CONTEXT BARRIER IN SMALL EQUIPMENT USING GLOBAL DATA STRUCTURES

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

RECORDING MEDIUM, RENDITION MECHANISM, PROGRAM, RENDITION PROCEDURE AND CIRCUIT INTEGRATED INTO THE SYSTEM

Method and system for managing execution of virtual applications

A system and method for directing download and execution of an application. A runtime engine receives an identifier of a block of shared memory from a directing process. The shared memory stores a map indicating which portions of an application file have been stored in a local copy of the application file. The runtime engine also receives an instruction from the directing process to execute the local copy when the local copy stores less than the entire application file. As the application executes, the runtime engine identifies requests from the application to access portions of the local copy and uses the map to determine whether the requested portions have been stored in the local copy. If the requested portions are not stored in the local copy, the runtime engine prevents the executing application from accessing the local copy until the map indicates the requested portions have been stored therein.

System and Method for Communication Between Concurrent Transactions Using Transaction Communicator Objects

Transactional memory implementations may be extended to include special transaction communicator objects through which concurrent transactions can communicate. Changes by a first transaction to a communicator may be visible to concurrent transactions before the first transaction commits. Although isolation of transactions may be compromised by such communication, the effects of this compromise may be limited by tracking dependencies among transactions, and preventing any transaction from committing unless every transaction whose changes it has observed also commits. For example, mutually dependent or cyclically dependent transactions may commit or abort together. Transactions that do not communicate with each other may remain isolated. The system may provide a communicator-isolating transaction that ensures isolation even for accesses to communicators, which may be implemented using nesting transactions. True (e.g., read-after-write) dependencies, ordering (e.g., write-after-write) dependencies, and/or anti-dependencies (e.g., write-after-read dependencies) may be tracked, and a resulting dependency graph may be perused by the commit protocol.

Methods for supporting users with task continuity and completion across devices and time

Concepts and technologies are described herein for providing task continuity and supporting task completion across devices and time. A task management application is configured to monitor one or more interactions between a user and a device. The interactions can include the use of the device, the use of one or more applications, and/or other tasks, subtasks, or other operations. Predictive models constructed from data or logical models can be used to predict the attention resources available or allocated to a task or subtask as well as the attention and affordances available within a context for addressing the task and these inferences can be used to mark or route the task for later reminding and display. In some embodiments, the task management application is configured to remind or execute a follow-up action when a session is resumed. Embodiments include providing users with easy to use gestures and mechanisms for providing input about desired follow up on the same or other devices.

Context switching

The disclosure relates generally to techniques, methods and apparatus for controlling context switching at a central processing unit. Alternatively, methods and apparatus are provided for providing security to memory blocks. Alternatively, methods and apparatus are provided for enabling transactional processing using a multi-core device.

method and system for acquiring a quiesceing set of information associated with a virtual machine

A method and system for acquiring a quiesceing set of information associated with a virtual machine. A virtual machine is cloned. The cloned virtual machine has an associated persistent storage device. The state of the persistent storage device is transformed into a quiesced state of the cloned virtual machine by utilizing a shut-down process. The shut-down process is executed on the cloned virtual machine to quiesce the cloned virtual machine and the quiesceing set of information of the cloned virtual machine is automatically reduced to information stored on the persistent storage device.

Processor support for secure device driver architecture

A system to increase the security of the state of interrupted applications may include a computer processor to process software running in a plurality of runtime environments. The system may also include an interrupt stack per runtime environment to assist in how the computer processor switches from one subroutine to another in the same environment and from one runtime environment to any of the other runtime environments. The system may further include a plurality of hardware-managed areas to store processor state information and to assist in how the computer processor switches from one runtime environment to any of the other runtime environments.

Send-Side Matching Of Data Communications Messages

Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

Control server, virtual server distribution method

When plural virtual servers are distributed to plural physical servers, efficient distribution is performed in terms of the processing capacity of the physical servers and their power consumption. Firstly a second load of each virtual server in future is predicted based on a first load in a prescribed time period up to the present of each of the plural virtual servers. Next, the schedule is determined to distribute the plural virtual servers to the plural physical servers based on the second load of each virtual server so that a total of the second loads of one or a plurality of the virtual servers distributed to a physical server is within a prescribed range of proportion with respect to processing capacity of the physical server. Furthermore, the distribution is instructed (execution of redistribution) in accordance with the schedule.

Performing computations in a distributed infrastructure

The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.

Providing fault-tolerant spread spectrum clock signals in a system

To provide fault-tolerant, spread spectrum clock signals, a plurality of processing modules having respective spread spectrum control circuits are provided. Clock signals of redundant clock sources are provided to the plurality of processing modules. Failover control logic selects a corresponding one of the clock signals from the redundant clock sources for use in each of the processing modules. Frequency spreading is applied to the corresponding selected clock signal in each of at least some of the plurality of processing module.

Transferring ownership privileges

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for transferring ownership privileges. In one aspect, a method includes identifying an ownership privilege in a system that permits users to acquire a write lock on one or more resources in a plurality of resources. The ownership privilege for a first plurality of users located in a first geographic region is revoked based at least partly on a determination that a current time of day in a different, second geographic region satisfies a criteria. The ownership privilege is granted to a different second plurality of users located in the second geographic location responsive to the determination.

Resource utilization management for a communication device

A technique for resource utilization management for a communication device includes provisioning 500 priority applications to be run in a priority mode on the communication device, triggering 502 a priority mode for the communication device, and minimizing 504 resources to any applications on the communication device that are not provisioned priority applications.

Custom atomics using an off-chip special purpose processor

An apparatus for executing an atomic memory transaction comprises a processing core in a multi-processing core system, where the processing core is configured to store an atomic program in a cache line. The apparatus further comprises an atomic program execution unit that is configured to execute the atomic program as a single atomic memory transaction with a guarantee of forward progress.

Globally sound and consistent configuration management for distributed datacenter components

Datacenter configuration needs to be managed. A configuration engine (CE) manages configuration data of clusters and/or datacenters. The CE allows users to check out, edit, and check in configuration components. Versioned interfaces are placed between configuration components through data contracts. The CE supports the expression of constraints that ensure global consistency across configuration components and versions, isolates changes in the datacenter from structural changes in configuration components, and enables partial configuration branching to allow for active snapshots that enable configuration rollback. The CE ensures that types are consistent and constraints are satisfied at check-in time to eliminate unsound or inconsistent configuration in the first place. When the active configuration in the datacenter changes, multiple versions of configuration may be simultaneously deployed for a window of time. The managed set of configuration is permitted to have multiple active versions during these transitional windows to reflect the reality in the datacenter.

Invasion Analysis to Identify Open Types

The automated identification of open types of a multi-function input program. The automated identification of open types is performed without annotations in the input program, but rather by identifying a set of invading types of the program, with each of the invading types being an open type. The identification of invading types may be performed iteratively until the set of invading types no longer grows. The set of open types may be used for any purpose such as perhaps the de-virtualization of an input program during compilation.

Performing predictive modeling of virtual machine relationships

An exemplary method may include collecting performance data of present operating conditions of network components operating in an enterprise network, extracting ontological component data of the network components from the collected performance data, comparing the collected performance data with predefined service tier threshold parameters, and determining if the ontological component data represents operational relationships between the network components, and establishing direct and indirect relationships between the network components based on the determined operational relationships and establishing a business application service group based on the ontological component data.

Policy-based access to virtualized applications

When a request is received to execute a virtualized application, an application virtualization client component evaluates an execution policy to determine if the application may be executed. If the application virtualization client component determines based on the execution policy that the virtualized application may be executed, the application virtualization client component publishes the virtualized application. The application virtualization client component publishes the application by making the virtualized application available for execution if the application is installed, and installing the virtualized application if it is not installed. The application virtualization client component also evaluates the execution policy during execution of the virtualized application. If the application virtualization client component determines that the execution policy is no longer satisfied, the application virtualization client component unpublishes the virtualized application, thereby preventing execution of the virtualized application.

Protected and virtual interfaces for com aggregation

An outer COM object can be provided with privileged access to protected functionality in an inner COM object. An inner COM object can offer a custom protected interface to an outer COM object by creating a new inner internals COM object that is not available to a calling application or by creating a new extension IUnknown interface that can be used to access the protected content. An outer COM object can override behavior in an inner COM object. An inner COM object can offer access to custom behavior to an outer COM object by creating a new inner internals COM object that is not available to a calling application. The new inner internals COM object can implement a new interface that provides access to the customized (override) content or can create a new extension IUnknown interface that can be used to provide access to the customized (override) content.

Method and system for using temporary exclusive blocks for parallel accesses to operating means

In at least one example embodiment, the invention relates to a computer-implemented method, a computer-implemented system and a computer program product for controlling the access to splittable resources in a distributed client server system operating in parallel. The resource control system is designed for a plurality of clients connected to the system and is used to maintain consistency of the data. When a client makes a first attempt to access a resource of the server, an exclusive lock for the requested resource is allocated to the accessing client, that blocks the access to the resource for other clients, said exclusive lock only being allocated for a pre-determinable period of time and then automatically discontinued.

Method for generating universal objects identifiers in distributed multi-purpose storage systems

A computer implemented method and system for generating secure universal object identifiers on a multipurpose storage system is disclosed. According to one embodiment, a system comprises a client system in communication with a network. An application server is in communication with the network. A storage cluster is in communication with the network. The storage cluster has a plurality of storage nodes. The client system stores a data object via the application server. The application server generates an object identifier assigned to the data object. The application server stores the data object on a storage node of the plurality of storage nodes. The data object is moved to another application server without moving contents of the data object in the storage cluster.

Techniques to automatically classify processes

Techniques for automatically classifying processes are presented. Processes executing on a multicore processor machine are evaluated to determine shared resources between the processes, excluding shared system resources. A determination is then made based on the evaluation to group the processes as a single managed resource within an operating system of the multicore processor machine.

Transaction control arrangement for device management system

A method for arranging transaction control in a device management system. A required transaction control operation is defined in a managing device for arranging transaction control of a management task for a managed device. At least one device management command is defined for the transaction control operation. The at least one device management command is transmitted to the managed device. A required transaction control operation is specified in the managed device onasis of one or more received device management commands, and transaction control for a management task is carried out on the basis of the defined transaction control operation.

Obtaining And Releasing Hardware Threads Without Hypervisor Involvement

A first hardware thread executes a software program instruction, which instructs the first hardware thread to initiate a second hardware thread. As such, the first hardware thread identifies one or more register values accessible by the first hardware thread. Next, the first hardware thread copies the identified register values to one or more registers accessible by the second hardware thread. In turn, the second hardware thread accesses the copied register values included in the accessible registers and executes software code accordingly.

Thread transition management

Various systems, processes, products, and techniques may be used to manage thread transitions. In particular implementations, a system and process for managing thread transitions may include the ability to determine that a transition is to be made regarding the relative use of two data register sets and determine, based on the transition determination, whether to move thread data in at least one of the data register sets to second-level registers. The system and process may also include the ability to move the thread data from at least one data register set to second-level registers based on the move determination.

Method to set up application to application communication over a network between applications running on endpoint devices

A method is provided to communicate media information over a network comprising: in response to a request from a first application running on a first endpoint device for a media connection with a second application running on a second endpoint device, sending a request over a network for a media connection with the second application; wherein the media connection request includes an application identifier (AppID) associated with the first application; sending an authorization request to an application manager server to obtain authorization for the requested media connection; wherein the authorization request includes the AppID associated with the first application; communicating control information over a control session set up between the first endpoint device and the second endpoint device; wherein the control information includes the AppID associated with the first application; and communicating media information over a media session.

Method, apparatus, and system for speculative execution event counter checkpointing and restoring

An apparatus, method, and system are described herein for providing programmable control of performance/event counters. An event counter is programmable to track different events, as well as to be checkpointed when speculative code regions are encountered. So when a speculative code region is aborted, the event counter is able to be restored to it pre-speculation value. Moreover, the difference between a cumulative event count of committed and uncommitted execution and the committed execution, represents an event count/contribution for uncommitted execution. From information on the uncommitted execution, hardware/software may be tuned to enhance future execution to avoid wasted execution cycles.

Protecting Large Objects Within an Advanced Synchronization Facility

A system and method are disclosed for allowing protection of larger areas than memory lines by monitoring accessed and dirty bits in page tables. More specifically, in some embodiments, a second associative structure with a different granularity is provided to filter out a large percentage of false positives. By providing the associative structure with sufficient size, the structure exactly specifies a region in which conflicting cache lines lie. If entries within this region are evicted from the structure, enabling the tracking for the entire index filters out a substantial number of false positives (depending on a granularity and a number of indices present). In some embodiments, this associative structure is similar to a translation look aside buffer (TLB) with 4 k, 2M entries.

Region-Weighted Accounting of Multi-Threaded Processor Core According to Dispatch State

According to one embodiment of the present disclosure, an approach is provided in which a thread is selected from multiple active threads, along with a corresponding weighting value. Computational logic determines whether one of the multiple threads is dispatching an instruction and, if so, computes a dispatch weighting value using the selected weighting value and a dispatch factor that indicates a weighting adjustment of the selected weighting value. In turn, a resource utilization value of the selected thread is computed using the dispatch weighting value.

Process for executing a downloadable service receiving restrictive access rights to at least one profile file

A process for executing a downloadable service with specific access rights to at least one profile file in a user's computer. The web browser is used for accessing a web server through a first set of communication port and socket. Therefore is arranged a confined runtime environment such as for example an extended sandbox ( 11 ) and used in Java programming which Is assigned a second communication port and s ockets and which is used for executing downloadable service with restricted access on at least one profile file. The process can be used for executing services under the form of a signed archive file which signature is used for both validating the archive file and for selecting one particular secure class loader prior to the generation of the compiled code of the service.

Thread folding tool

A computer-implemented method of performing runtime analysis on and control of a multithreaded computer program. One embodiment of the present invention can include identifying threads of a computer program to be analyzed. Under control of a supervisor thread, a plurality of the identified threads can be folded together to be executed as a folded thread. The execution of the folded thread can be monitored to determine a status of the identified threads. An indicator corresponding to the determined status of the identified threads can be presented in a user interface that is presented on a display.

Systems and methods for managing applications

A system for managing applications. The system includes a first device, a second device, a first interface and a second interface. The first device is responsible for exhibiting and providing the applications to one or more user(s). The second device is responsible for managing the applications which are uploaded by one or more developer(s) who have developed the applications. The first interface is provided for the second device to submit the applications to the first device. The second interface is provided for the first device to transmit at least a report message to the second device.

Resource Allocation Method and Device for Foreground Switch of J2ME Application

A resource allocation method and a resource allocation device for foreground switch of a J2ME (Java 2 Micro Edition) application are provided in the present invention. A JAVA application program receives a first message from a JAVA virtual machine when switching to background from foreground, wherein the first message carries information indicating that the JAVA application program needs to release partial resources; and the JAVA application program returns a first response message to the JAVA virtual machine so as to realize release of the resources, wherein the first response message carries information of resources to be released and/or information of resources to be reserved for restoring to an executing state. The user experience can be improved and the normal use of local applications can be ensured according to the technical solution provided by the present invention.

Heterogeneous isa microprocessor that preserves non-isa-specific configuration state when reset to different isa

A microprocessor capable of operating as both an x86 ISA and an ARM ISA microprocessor includes first, second, and third storage that stores x86 ISA-specific, ARM ISA-specific, and non-ISA-specific state, respectively. When reset, the microprocessor initializes the first storage to default values specified by the x86 ISA, initializes the second storage to default values specified by the ARM ISA, initializes the third storage to predetermined values, and begins fetching instructions of a first ISA. The first ISA is the x86 ISA or the ARM ISA and a second ISA is the other ISA. The microprocessor updates the third storage in response to the first ISA instructions. In response to a subsequent one of the first ISA instructions that instructs the microprocessor to reset to the second ISA, the microprocessor refrains from modifying the non-ISA-specific state stored in the third storage and begins fetching instructions of the second ISA.

System and method for application program operation on a wireless device

Embodiments described herein address mobile devices with non-secure operating systems that do not provide a sufficient security framework. More particularly, the embodiments described herein provide a set of applications to the device for providing security features to the non-secure operating system.

Transmission control device, memory control device, and plc including the transmission control device

A transmission control device in the present invention includes: a data storage memory in which data are written; a plurality of data copy memories into which the data written in the data storage memory are copied; an unread copy-memory selection unit that selects one of the data copy memories for which reading of data is not performed from among the data copy memories; a memory copy unit that copies the data written in the data storage memory into a data copy memory selected by the unread copy-memory selection unit; a read copy-memory selection unit that selects a data copy memory into which the memory copy unit copies data from among the data copy memories; and a data output unit that reads data from a data copy memory selected by the read copy-memory selection unit and outputs the read data to a transmission unit.

Data processing apparatus and method for processing a received workload in order to generate result data

A data processing apparatus and method are provided for processing a received workload in order to generate result data. A thread group generator generates from the received workload a plurality of thread groups to be executed to process the received workload. Each thread group consists of a plurality of threads, and at least one thread group has an inter-thread dependency existing between the plurality of threads. Each thread may be either an active thread whose output is required to form the result data, or a dummy thread required to resolve the inter-thread dependency for one of the active threads but whose output is not required to form the result data. The thread group generator identifies for each thread group any dummy thread within that thread group. A thread execution unit then executes each thread within a thread group received from the thread group generator by executing a predetermined program comprising a plurality of program instructions. Execution flow modification circuitry is responsive to the received thread group having at least one dummy thread, to cause the thread execution unit to selectively omit at least part of the execution of at least one of the plurality of instructions when executing each dummy thread, in dependence on control information associated with the predetermined program. In one particular embodiment the received workload is a graphics rendering workload and the thread execution unit performs graphics rendering operations in order to generate as the result data pixel values and associated control values. Such an approach can yield significant improvements in performance, as well as reducing power consumption.

Operating system decoupled heterogeneous computing

A heterogeneous processing system is described herein that provides a software hypervisor to autonomously control operating system thread scheduling across big and little cores without the operating system's awareness or involvement to improve energy efficiency or meet other processing goals. The system presents a finite set of virtualized compute cores to the operating system to which the system schedules threads for execution. Subsequently, the hypervisor intelligently controls the physical assignment and selection of which core(s) execute each thread to manage energy use or other processing requirements. By using a software hypervisor to abstract the underlying big and little computer architecture, the performance and power operating differences between the cores remain opaque to the operating system. The inherent indirection also decouples the release of hardware with new capabilities from the operating system release schedule.

Systems and methods for supporting transactional message handling

In accordance with embodiments disclosed herein, there are provided methods, systems, and apparatuses including, for supporting transactional message handling in an on-demand service environment including, for example: enqueuing a message specifying a transaction to be processed via a host organization; inserting a row into a database of the host organization associating the message with a status of pending, wherein the row is autocommitted to the database upon insertion; updating the status for the row to ready if a commit operation for the transaction is initiated; requesting a lock on the row; and performing final processing for the transaction based on the status for the message and based further on whether the lock is obtained for the row. Final processing may include, for example, a transaction roll back, a transaction commit, a transaction requeue, a termination of transaction processing, or an orphaned transaction clean up.

Techniques for moving data between memory types

A two-level paging mechanism. The first level gathers data from reclaimable memory locations for a process and compacts the data into a single container. The second level sends the compact container's contents to a swap file and may use optimal I/O operations to the target memory device. On-demand paging is made possible by having a first pager locate the requested data in the compact container and then having a second pager retrieve the corresponding data from the swap file.

Batching and Forking Resource Requests In A Portable Computing Device

In a portable computing device having a node-based resource architecture, resource requests are batched or otherwise transactionized to help minimize inter-processing entity messaging or other messaging or provide other benefits. In a resource graph defining the architecture, each node or resource of the graph represents an encapsulation of functionality of one or more resources controlled by a processor or other processing entity, each edge represents a client request, and adjacent nodes of the graph represent resource dependencies. A single transaction of resource requests may be provided against two or more of the resources. Additionally, this single transaction may become forked so that parallel processing among a client issuing the single transaction and the resources handling the requests of the single transaction may occur.

Virtualizable and Forward-Compatible Hardware-Software Interface

Methods and apparatus are disclosed for virtualizable, forward-compatible hardware-software interfaces. Embodiments may be used in a driver whether it is a physical driver or a virtual driver. Commands are queued from the driver and fetched to the device. An actions table is accessed to determine if drivers are permitted to perform commands. Events are queued for the drivers responsive to commands. If drivers are not permitted to perform a command, device firmware may forward the command to a privileged driver to perform the required command. If a driver is only permitted to perform a command with assistance the command is forwarded for corrections and execution. If a command is to be dropped, a completion event may be queued as if the command had executed. Drivers may have no indication of which actions were taken. The actions table may be changed for hardware/software modifications or dynamically according to configuration changes.

Thin client system, and access control method and access control program for thin client system

To heighten security in a thin client system, the thin client system includes: a communication unit 21 that receives a user ID and terminal information including at least current position information from a client terminal 10 ; a policy information extraction unit 22 that extracts policy information relating to a security policy stored in association with the terminal information received by the communication unit 21 on the basis of the terminal information; a virtual machine allocation unit 32 that allocates a virtual machine virtualizing an environment of the client terminal 10 to a server device 30 on the basis of the user ID received from the client terminal 10 ; and an access control unit 33 that restricts access to the virtual machine allocated by the virtual machine allocation unit 32 on the basis of the policy information extracted by the policy information extraction unit 22.

On-chip memory (ocm) physical bank parallelism

According to an example embodiment, a processor is provided including an integrated on-chip memory device component. The on-chip memory device component includes a plurality of memory banks, and multiple logical ports, each logical port coupled to one or more of the plurality of memory banks, enabling access to multiple memory banks, among the plurality of memory banks, per clock cycle, each memory bank accessible by a single logical port per clock cycle and each logical port accessing a single memory bank per clock cycle.

Information processing device and task switching method

Disclosed is an information processing device and a task switching method that can reduce the time required for switching of tasks in a plurality of coprocessors. The information processing device includes a processor core; coprocessors including operation units that perform operation in response to a request from the processor core and operation storage units that store the contents of operation of the operation units, save storage units that store the saved contents of operation, a task switching control unit that outputs a save/restore request signal when switching a task on which operation is performed by the coprocessors-, and save/restore units that perform at least one of saving of the contents of operation in the operation storage units to the save storage units and restoration of the contents of operation in the save storage units to the operation storage units in response to the save/restore request signal.

End-to-End Content Delivery Network Incorporating Independently Operated Transparent Caches and Proxy Caches

Some embodiments provide an end-to-end federated CDN solution that assimilates a transparent caching server that is operated by a transparent caching server operator into a CDN that independently operates CDN caching servers. Specifically, the logs from the transparent caching server are assimilated into the CDN by aggregating the logs from the transparent caching server and processing the transparent caching server logs to identify network usage for content of a CDN content provider customer that is delivered by the transparent caching server. The network usage is then combined with the network usage that tracked by the CDN caching servers in order to provide comprehensive report metrics for the content provider customer and to bill the content provider customer for all network usage related to delivering the content provider customer's content irrespective of whether the content was delivered by a transparent caching server or a CDN caching server.

Mechanisms To Accelerate Transactions Using Buffered Stores

In one embodiment, the present invention includes a method for executing a transactional memory (TM) transaction in a first thread, buffering a block of data in a first buffer of a cache memory of a processor, and acquiring a write monitor on the block to obtain ownership of the block at an encounter time in which data at a location of the block in the first buffer is updated. Other embodiments are described and claimed.

Automated web task procedures based on an analysis of actions in web browsing history logs

Embodiments of the invention relate to generating automated web task procedures from an analysis of web history logs. One aspect of the invention concerns a method that comprises identifying sequences of related web actions from a web log, grouping each set of similar web actions into an action class, and mapping the sequences of related web actions into sequences of action classes. The method further clusters each group of similar sequences of action classes into a cluster, wherein relationships among the action classes in the cluster are represented by a state machine, and generates automated web task procedures from the state machine.

Method and apparatus for multiple access of plural memory banks

A processor with on-chip memory including a plurality of physical memory banks is disclosed. The processor includes a method, and corresponding apparatus, of enabling multi-access to the plurality of physical memory banks The method comprises selecting a subset of multiple access requests to be executed in at least one clock cycle over at least one of a number of access ports connected to the plurality of physical memory banks, the selected subset of access requests addressed to different physical memory banks, among the plurality of memory banks, and scheduling the selected subset of access requests, each over a separate access port.

Send-side matching of data communications messages

Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

PROCESSING TECHNIQUES FOR SERVERS HANDLING CLIENT/SERVER TRAFFIC AND COMMUNICATIONS

A system for handling client/server traffic and communications pertaining to the delivery of hypertext information to a client. The system includes a central server which processes a request for a web page from a client. The system operates by receiving a request for a web page from a client. Relevant information is then processed by an annotator to generate additional relevant computer information that can be incorporated to create an annotated version of the requested web page which includes additional displayable hypertext information. The central server then relays the additional relevant computer information to the client so as to allow the annotated version of the requested web page to be displayed. The central server can also interact with different servers to collect and maintain statistical usage information. 1. A computer system for optimizing processing of an annotation request from a client , comprising:a request processor for receiving said annotation request from said client;a task queue for storing a plurality of constituent tasks that need to be performed for said annotation request;a thread-controlling means for maintaining a plurality of threads; andan assigning means for assigning said plurality of threads to said plurality of constituent tasks in said task queue.2. A computer system according to claim 1 , wherein said plurality of threads is independent from said plurality of constituent tasks stored in said task queue.3. A computer system according to claim 1 , wherein said plurality of threads is persistent.4. A computer system according to claim 1 , wherein said plurality of constituent tasks is arranged in a substantially first-in-first-out basis within said task queue.5. A computer system according to claim 1 , wherein when a thread is available for assignment claim 1 , said thread is assigned to a constituent task when said constituent task is ready for execution.6. A computer system according to claim 5 , wherein said assigned thread is ...

COMPOSITE TASK FRAMEWORK

A primary task manager, which is a local task manager, can perform a distributed task on a local server. If the performing of the task with the local task manager succeeds, the distributed task can then be propagated to at least one secondary task manager, which is a remote task manager. The remote task manager is capable of performing the distributed task. If the performing of the task with the local task manager fails, an undo task that is associated with the distributed task can be performed. 1. A method for performing a composite task with a plurality of subtasks , comprising:determining, via one or more processors, an associated undo task for each subtask in the plurality of subtasks of the composite task, wherein at least one subtask of the plurality of subtasks is a distributed subtask;performing recursively each subtask in the plurality of subtasks, wherein the performing of the plurality of subtasks of the composite task includes a performing of the at least one subtask by a remote task manager on a remote server, wherein the performing of the at least one subtask generates one or more results on the remote server;collecting the one or more results for the at least one subtask from the remote task manager; andperforming the associated undo task for each subtask in the plurality of subtasks of the composite task, if the performing of any subtask of the plurality of subtasks fails.2. The method of claim 1 , further comprising:if a performing of any subtask in the plurality of subtasks fails, forgoing the performing of any remaining subtasks.3. The method of claim 1 , further comprising:performing an undo task for a subtask undoes one or more execution effects of performing the subtask.4. The method of claim 1 , wherein the performing each subtask in the plurality of subtasks includes:performing a local subtask in the plurality of subtasks on a local task manager.5. The method of claim 1 , further comprising:mapping the one or more results for the distributed ...

PERFORMING COLLECTIVE OPERATIONS IN A DISTRIBUTED PROCESSING SYSTEM

Methods, apparatuses, and computer program products for performing collective operations on a hybrid distributed processing system including: determining by at least one task that a parent of the task has failed to send the task data through the tree topology; and determining whether to request the data from a grandparent of the task or a peer of the task in the same tier in the tree topology; and if the task requests the data from the grandparent, requesting the data and receiving the data from the grandparent of the task through the second networking topology; and if the task requests the data from a peer of the task in the same tier in the tree, requesting the data and receiving the data from a peer of the task through the second networking topology. 1. A method of performing collective operations on a hybrid distributed processing system , the hybrid distributed processing system including a plurality of compute nodes , each compute node having a plurality of tasks , each task assigned a unique rank , each compute node coupled for data communications by at least one data communications network implementing at least two different networking topologies , wherein a first networking topology comprises a tiered tree topology having a root task , and at least two child tasks , where the two child tasks are peers of one another in the same tier , the method comprising:determining by at least one task that a parent of the task has failed to send the task data through the tree topology; anddetermining whether to request the data from a grandparent of the task or a peer of the task in the same tier in the tree topology;if the task requests the data from the grandparent, requesting the data and receiving the data from the grandparent of the task through the second networking topology; andif the task requests the data from a peer of the task in the same tier in the tree, requesting the data and receiving the data from a peer of the task through the second networking ...

APPLICATION PROGRAMMING INTERFACES FOR DATA PARALLEL COMPUTING ON MULTIPLE PROCESSORS

A method and an apparatus for a parallel computing program calling APIs (application programming interfaces) in a host processor to perform a data processing task in parallel among compute units are described. The compute units are coupled to the host processor including central processing units (CPUs) and graphic processing units (GPUs). A program object corresponding to a source code for the data processing task is generated in a memory coupled to the host processor according to the API calls. Executable codes for the compute units are generated from the program object according to the API calls to be loaded for concurrent execution among the compute units to perform the data processing task. 1. A parallel computing system comprising:a host processor; 'coupled to the host processor;', 'one or more compute units'} generating a program object corresponding to a source code for a data processing task;', 'generating executable codes from the program object for the one or more compute units; and', 'loading the executable codes to be executed concurrently among the one or more compute units to perform the data processing task., 'a memory coupled to at least one of the host processor and the one or more compute units, wherein a parallel computing program is stored in the memory, the parallel computing program including calls to one or more APIs (application programming interface) for the host processor to perform2. The system of claim 1 , wherein the program object includes a binary code compiled from the source code claim 1 , wherein the binary code includes descriptions of at least one of the one or more compute units.3. The system of claim 2 , wherein the generation of the program object comprises:retrieving the binary code from a precompiled library, wherein the binary codes include the executable codes.4. The system of claim 2 , wherein the generation of the executable codes comprises:compiling the source code into the binary code according to one or more ...

Common Idle State, Active State And Credit Management For An Interface

In one embodiment, the present invention includes method for entering a credit initialization state of an agent state machine of an agent coupled to a fabric to initialize credits in a transaction credit tracker of the fabric. This tracker tracks credits for transaction queues of a first channel of the agent for a given transaction type. The agent may then assert a credit initialization signal to cause credits to be stored in the transaction credit tracker corresponding to the number of the transaction queues of the first channel of the agent for the first transaction type. Other embodiments are described and claimed.

Tracking operand liveliness information in a computer system and performance function based on the liveliness information

Operand liveness state information is maintained during context switches for current architected operands of executing programs the current operand state information indicating whether corresponding current operands are any one of enabled or disabled for use by a first program module, the first program module comprising machine instructions of an instruction set architecture (ISA) for disabling current architected operands, wherein a current operand is accessed by a machine instruction of said first program module, the accessing comprising using the current operand state information to determine whether a previously stored current operand value is accessible by the first program module.

Privilege level aware processor hardware resource management facility

Multiple machine state registers are included in a processor core to permit distinction between use of hardware facilities by applications, supervisory threads and the hypervisor. All facilities are initially disabled by the hypervisor when a partition is initialized. When any access is made to a disabled facility, the hypervisor receives an indication of which facility was accessed and sets a corresponding hardware flag in the hypervisor's machine state register. When an application attempts to access a disabled facility, the supervisor managing the operating system image receives an indication of which facility was accessed and sets a corresponding hardware flag in the supervisor's machine state register. The multiple register implementation permits the supervisor to determine whether particular hardware facilities need to have their state saved when an application context swap occurs and the hypervisor can determine which hardware facilities need to have their state saved when a partition swap occurs.

Priority Level Arbitration Method and Device

The present invention discloses a method and device for arbitrating priority levels. The method comprises: setting a plurality of first stage polling arbiters and a second stage priority level arbiter respectively, wherein the number of the first stage polling arbiters is equal to the number of priority levels contained in a plurality of source ends; receiving task request signals for requesting tasks from the plurality of source ends and assigning request tasks with the same priority level to the same first stage polling arbiter; each of the first stage polling arbiters polling the received request tasks with the same priority level respectively to obtain one request task and transmitting the request task to the second stage priority level arbiter; and the second stage priority level arbiter receiving the plurality of request tasks and outputting an output result of request tasks with the highest priority level to a destination end.

MONITORING PERFORMANCE ON WORKLOAD SCHEDULING SYSTEMS

The present invention relates to the field of enterprise network computing. In particular, it relates to monitoring workload of a workload scheduler. Information defining a plurality of test jobs of low priority is received. The test jobs have respective launch times, and are launched for execution in a data processing system in accordance with said launch times and said low execution priority. The number of test jobs executed within a pre-defined analysis time range is determined A performance decrease warning is issued if the number of executed test jobs is lower than a predetermined threshold number. A workload scheduler discards launching of jobs having a low priority when estimating that a volume of jobs submitted with higher priority is sufficient to keep said scheduling system busy. 1. A method for monitoring workload of a scheduling system , comprising:scheduling each of a total number of a plurality of test jobs in a scheduling system for execution by a data processing system within an analysis time range period, wherein each of the test jobs is scheduled to run at different respective periodic interval launch times within the analysis time range period and has a lowest priority within said scheduling system, and wherein a plurality of other jobs are scheduled in the scheduling system for execution by the data processing system within the analysis time range period and each of the other jobs have priorities that are higher than the lowest priority of the test jobs;at an end of the analysis time range period, determining a number of said scheduled plurality of test jobs that were executed within the analysis time range period by said data processing system; andissuing a first performance decrease warning if the determined number of executed test jobs is lower than a threshold amount of the total scheduled number of the plurality of test jobs; andwherein said scheduling system adds each of the test jobs and the other jobs to a queue as a function of relative ...

Load control device

A load control device 10 for assigning transaction processes to a plurality of computation resources has: a receiver 101 that receives a transaction process request; an assignment controller 102 that selects appropriate assignment destinations to which received transactions are assigned, and then stores the transactions in transmission queues 103 provided for the assignment destinations respectively; a transmitter 104 that transmits transaction data stored in the transmission queues 103 to the assignment destinations; an overflow detector 105 that monitors whether or not the number of transactions accumulated in each of the transmission queues 103 corresponding to the respective assignment destinations exceeds an upper limit; and a reassigning part 106 that, when the number of transactions exceeds the upper limit as a result of the monitoring by the overflow detector 105, reselects assignment destinations to which the transactions stored at the number of transactions exceeding the upper limit are assigned.

CONSTRUCTING CHANGE PLANS FROM COMPONENT INTERACTIONS

Techniques for constructing change plans from one or more component interactions are provided. For example, a computer-implemented technique includes observing at least one interaction between two or more components of at least one distributed computing system, consolidating the at least one interaction into at least one interaction pattern, and using the at least one interaction pattern to construct at least one change plan useable for managing the at least one distributed computing system. In another computer-implemented technique, a partial order of two or more changes is determined from at least one component interaction, and is automatically transformed into at least one ordered task, wherein the at least one ordered task is linked by at least one temporal ordering constraint, and is used to generate at least one change plan useable for managing the distributed computing system is generated, wherein the change plan is based on at least one requested change. 1. A computer-implemented method for automatically determining at least one change plan from at least one component interaction , the method comprising the steps of:observing at least one interaction between two or more components of at least one distributed computing system in which invocation of at least a first component leads to invocation of at least a second component, wherein the at least one interaction is observed at least in part by tracking respective invocations of the two or more components;determining a partial order of two or more changes from the at least one observed to component interaction in the at least one distributed computing system;automatically transforming the partial order of two or more changes into at least one ordered task, wherein the at least one ordered task is linked by at least one temporal ordering constraint; andusing the at least one ordered task to generate at least one change plan useable for managing the at least one distributed computing system, wherein the at least ...

System for Managing Data Collection Processes

A system and process for managing data collection processes is disclosed. An apparatus that incorporates teachings of the present disclosure can include, a data collection system having a controller element that assigns to each of the processes a query interval according to a priority level of the data collection process for requesting use of processing resources, receiving one or more requests from the processes, once per respective query interval, for use of at least a portion of available processing resources, releases at least a portion of the available processing resources to a requesting one of the processes when the use of the available processing resources exceeds a utilization threshold. Additional embodiments are disclosed. 1. A method comprising:assigning, by a system comprising a processor, a respective priority level to each data collection process of a plurality of data collection processes for collecting data from one or more remote computing devices;assigning, by the system, a query interval to a data collection process of the plurality of data collection processes at least in part according to a priority level of the data collection process;receiving, by the system, one or more requests from the data collection process for use of at least a portion of available processing resources of a controller, wherein the one or more requests are sent by the data collection process once per the query interval;releasing, by the system, the portion of the available processing resources of the controller to the requesting data collection process when the use of the available processing resources exceeds a first utilization threshold; andmodifying the query interval of the data collection process after occurrence of a triggering event,wherein the query interval comprises a frequency for requesting the available processing resources.2. The method of claim 1 , wherein the releasing of the portion of the available processing resources is repeated at the query interval ...

METHOD FOR PERFORMING TRANSACTIONS ON DATA AND A TRANSACTIONAL DATABASE

The present invention provides a method for performing transactions on data entities in a database and a transactional database. The database comprises an ordered set of data stores with at least one static data store, wherein said static data store uses an index structure based on a non-updatable representation of an ordered set of integers according to the principle of compressed inverted indices. The method allows to generate a modifiable data store when the performed transaction comprises an insert, update or delete operation, to execute operations of the transaction on the ordered set being present at the time when the transaction has been started and, if present, on the modifiable data store and to convert data stores to a new static data store, The insert, update or delete operation are executed on the modifiable data store which is the only data store modifiable for the transaction. 1. A method for performing transactions on data entities in a database , wherein each transaction comprises one or more operations , wherein said database comprises an ordered set of data stores with at least one static data store for storing data entities and performing queries on said data entities , wherein said static data store uses an index structure which is based on a non-updatable representation of an ordered set of integers according to a principle of compressed inverted indices , wherein each of said data entities comprises an unique identifier and a plurality of fields each containing a single or multi valued value , the method comprising for a transaction the steps of:determining a current ordered set of data stores when said transaction is started;storing information of said current ordered set of data stores as transactional state for said transaction;when said transaction comprises an insert, update or delete operation, generating a modifiable data store and adding said modifiable data store as newest data store to said transactional state for said transaction, ...

ESTABLISHING A GROUP OF ENDPOINTS IN A PARALLEL COMPUTER

A parallel computer executes a number of tasks, each task includes a number of endpoints and the endpoints are configured to support collective operations. In such a parallel computer, establishing a group of endpoints receiving a user specification of a set of endpoints included in a global collection of endpoints, where the user specification defines the set in accordance with a predefined virtual representation of the endpoints, the predefined virtual representation is a data structure setting forth an organization of tasks and endpoints included in the global collection of endpoints and the user specification defines the set of endpoints without a user specification of a particular endpoint; and defining a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification. 1. A method of establishing a group of endpoints configured to support collective operations in a parallel computer , where each endpoint is included in a task , each task comprises one or more endpoints , the method comprising:receiving a user specification of a set of endpoints included in a global collection of endpoints, the user specification defining the set in accordance with a predefined virtual representation of the endpoints, wherein the predefined virtual representation of the endpoints comprises a data structure setting forth an organization of tasks and endpoints included in the global collection of endpoints and wherein the user specification defines the set of endpoints without a user specification of a particular endpoint; anddefining a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification.2. The method of wherein:receiving a user specification of a set of endpoints further comprises receiving a plurality of user specifications of a set of endpoints, each specification defining a different group of endpoints in accordance with the predefined virtual ...

Apparatus and method for reducing overhead caused by communication between clusters

A technique for minimizing overhead caused by copying or moving a value from one cluster to another cluster is provided. A number of operations, for example, a mov operation for moving or copying a value from one cluster to another cluster and a normal operation may be executed concurrently. Accordingly, access to a register file outside of the cluster may be reduced and the performance of code may be improved.

Task Backpressure and Deletion in a Multi-Flow Network Processor Architecture

Described embodiments generate tasks corresponding to packets received by a network processor. A source processing module sends task messages including a task identifier and a task size to a destination processing module. The destination module receives the task message and determines a queue in which to store the task. Based on a used cache counter of the queue and a number of cache lines for the received task, the destination module determines whether the queue has reached a usage threshold. If the queue has reached the threshold, the destination module sends a backpressure message to the source module. Otherwise, if the queue has not reached the threshold, the destination module accepts the received task, stores data of the received task in the queue, increments the used cache counter for the queue corresponding to the number of cache lines for the received task, and processes the received task. 1. A method of processing a received packet of a network processor , wherein the network processor comprises a plurality of processing modules and at least one shared memory , the method comprising:generating one or more tasks corresponding to each received packet;sending, by a source processing module, a task message corresponding to a task to a destination processing module, the task message comprising a task identifier and a task size;receiving, by the destination processing module, the task message;determining, by the destination processing module, (i) an associated one of a plurality of task queues of the destination processing module in which to store the task, and (ii) based on (1) a used cache counter of the destination processing module associated with the associated task queue and (2) a number of cache lines required for the received task, whether the associated task queue has reached a usage threshold; 'sending a backpressure message to the source processing module;', 'if the associated task queue has reached the usage threshold accepting the received task and ...

Realizing jumps in an executing process instance

A method for realizing jumps in an executing process instance can be provided. The method can include suspending an executing process instance, determining a current wavefront for the process instance and computing both a positive wavefront difference for a jump target relative to the current wavefront and also a negative wavefront difference for the jump target relative to the current wavefront. The method also can include removing activities from consideration in the process instance and also adding activities for consideration in the process instance both according to the computed positive wavefront difference and the negative wavefront difference, creating missing links for the added activities, and resuming executing of the process instance at the jump target.

Usb redirection for read transactions

Methods and systems for conducting a transaction between a virtual USB device driver and a USB device are provided. A virtual USB manager of a hypervisor receives a one or more data packets from a client. The virtual USB manager stores of the one or more data packets in a buffer. The virtual USB manager dequeues a data packet from the buffer. The virtual USB manager transmits the data packet to the virtual USB device driver for processing.

Identification of Thread Progress Information

Embodiments relate to a method, apparatus and program product and for capturing thread specific state timing information. The method includes associating a time field and a time valid field to a thread data structure and setting a current time state by determining a previous time state and updating it according to a previously identified method for setting time states. The method further includes determining status of a time valid bit to see if it is set to valid or invalid. When the status is valid, it is made available for reporting. 1. A method comprising:associating a time field and a time valid field to a thread data structure;setting a current time state by determining a previous time state and updating it according to a previously identified method for setting time states;determining status of a time valid bit; said status being set to valid or invalid; andsaid status being made available for reporting when said time valid bit has a valid status.2. The method of claim 1 , wherein said time valid bit is set to invalid further comprising:updating said time field based on said status being invalid, said updating being performed by calculating according to said previously identified method for setting time states, an obtained value for said time valid bit;resetting said time valid field to a valid status after updating said time valid bit and making said time field entry available for reporting.3. The method of claim 1 , wherein said thread data structure has associated states with at least one state being defined as an interesting state and a phase entry and exit point is defined with said interesting state.4. The method of claim 3 , wherein said time valid field is set to invalid status when said phase exit point occurs for said interesting state.5. The method of claim 1 , wherein an enhanced thread is formed by adding said time field and said time valid field to said thread data structure.6. The method of claim 2 , wherein said previously identified method ...

TECHNIQUES TO AUTOMATICALLY CLASSIFY PROCESSES

Techniques for automatically classifying processes are presented. Processes executing on a multicore processor machine are evaluated to determine shared resources between the processes, excluding shared system resources. A determination is then made based on the evaluation to group the processes as a single managed resource within an operating system of the multicore processor machine. 1. A method implemented in a non-transitory machine-readable storage medium and processed by one or more processors configured to perform the method , comprising:gathering metrics for resources used by a first process and a second process in a multicore processing architecture; andgrouping the first process and the second process together based on metrics evaluated for usage of the resources by the first and second processes within the multicore processing architecture.2. The method of claim 1 , wherein gathering further includes excluding system resources shared between the first and second processes from the resources for which the metrics are gathered.3. The method of claim 1 , wherein re-gathering the metrics when a third processes is detected as being forked off or spawned from either the first process or the second process.4. The method of claim 1 , wherein gathering further includes identifying the multicore architecture as a cloud processing environment.5. The method of claim 1 , wherein gathering further includes collecting the metrics for each of the resources as a percentage of that resource being consumed by the first process and the second process.6. The method of claim 5 , wherein collecting further includes comparing each percentage against threshold values to assist in determining whether to group the first and second processes together within the multicore architecture.7. The method of claim 1 , wherein gathering further includes evaluating heuristics to dynamically determine types of the metrics to gather.8. The method of claim 7 , wherein evaluating further includes ...

METHOD TO GUARANTEE REAL TIME PROCESSING OF SOFT REAL-TIME OPERATING SYSTEM

A method to guarantee real time processing of a soft real time operating system in a multicore platform by executing a thread while varying a core in which the thread is executed and apparatus are provided. The method includes assigning priority to a task thread, executing the task thread, determining a core in which the task thread is to be executed, and if the core is determined, transferring the task thread to the determined core. 1. A method to guarantee real time processing of a soft real time operating system in a multicore platform , comprising:assigning priority to a task thread;executing the task thread;determining a core in which the task thread is to be executed; andif the core is determined, transferring the task thread to the determined core.2. The method according to claim 1 , further comprising:if the task thread is transferred, waiting until an execution period of the task thread arrives; andif the execution period of the task thread arrives, executing the task thread in the determined core.3. The method according to claim 2 , wherein a wait interval until an execution period of the task thread arrives includes spinning or a combination of spinning and sleep.4. The method according to claim 1 , wherein executing the task thread includes executing the task thread when a predetermined execution period of the task thread is started.5. The method according to claim 1 , wherein determining the core in which the task thread is to be performed includes determining a core in which a task thread of a next period is to be performed according to a predetermined task thread arrangement scheme.6. A computer-readable recording medium in which a program to execute the method according to any one of to is recorded.7. An apparatus to guarantee real time processing of a soft real time operating system in a multicore platform claim 1 , comprising:a first core configured to transfer a task thread having priority according to a predetermined task thread arrangement ...

AUTOMATICALLY GENERATING COMPOUND COMMANDS IN A COMPUTER SYSTEM

A computer system provides a way to automatically generate compound commands that perform tasks made up of multiple simple commands. A compound command generation mechanism monitors consecutive user commands and compares the consecutive commands a user has taken to a command sequence identification policy. If the user's consecutive commands satisfy the command sequence identification policy the user's consecutive commands become a command sequence. If the command sequence satisfies the compound command policy, the compound generation mechanism can generate a compound command for the command sequence automatically or prompt an administrator to allow the compound command to be generated. Generating a compound command can be done on a user by user basis or on a system wide basis. The compound command can then be displayed to the user to execute so that the command sequence is performed by the user selecting the compound command for execution. 1. A computer-implemented method for automatically generating a compound command from a user as the user performs commands , the method comprising the steps of:(A) providing at least one processor;(B) providing a memory coupled to the at least one processor;(C) the user performs a command;(D) when the command satisfies a command identification policy, adding the command to a command sequence;(E) performing steps (C)-(D) until a completion criteria is satisfied; and(F) when the command sequence satisfies a compound command policy, automatically generating the compound command.2. The method of wherein the compound command automatically executes all commands in the command sequence.3. The method of wherein the command sequence comprises a plurality of simple commands.4. The method of wherein the command sequence comprises at least one simple command and at least one compound command.5. The method of wherein the compound command policy specifies a threshold number of times the command sequence must have occurred.6. The method of ...

Hardware computing system with software mediation and method of operation thereof

A method of operation of a hardware computing system includes: generating a command stream by a general purpose central processing unit; and receiving, by an application manager, the command stream for executing a command by a programmable execution engine and providing a status through a command execution interface to the general purpose central processing unit for the command from the command stream.

Logically Partitioning Remote Virtual Library Extensions for Use in Disaster Recovery of Production Data

Systems and methods that make use of logical partitions of a second tier of disk storage at a disaster recovery (DR) site remote from a production site as part of a DR setup to advantageously reduce disruption to production site data production operations during DR procedures while providing for the substantially immediate recall or retrieval of data previously migrated to the remote second tier of disk storage.

Information processing apparatus and method of controlling virtual machine

According to one embodiment, an apparatus includes a controller. The controller is configured to control an operation environment of a virtual machine which runs on a hypervisor. The controller includes a change module configured to change the virtual machine from an operating state to a sleep state, in response to a logout request for an operating system in the virtual machine, a storing module configured to store first image data indicating contents of a memory in a storage as an operation environment, a restoration module configured to restore the contents of the memory to contents based on second image data, and a return module configured to return the virtual machine to the operating state after the contents of the memory is restored to the contents based on the second image data.

PARALLEL COMPUTER, AND JOB INFORMATION ACQUISITION METHOD FOR PARALLEL COMPUTER

A parallel computer includes a plurality of calculation nodes and a management node. A calculation node includes a retention control unit that retains job information in a retention unit in association with an identification number, and the management node includes a retention control unit that retains the job information in a retention unit, retains, as a snapshot, job information of the same identification number in a case where the job information of the same identification number about a calculation node is detected in the retention unit. The retention unit of the calculation node includes a retention region enabling retention of job information corresponding to a plurality of periods, and the retention unit of the management node includes a retention region enabling retention of the job information corresponding to the plurality of periods with respect to each of the calculation nodes. 1. A parallel computer comprising:a plurality of calculation nodes that execute a calculation job distributively in parallel; anda management node that manages the plurality of calculation nodes,wherein one of the calculation nodes comprises:an acquisition unit that acquires job information about a calculation job handled by the one of the calculation nodes according to a period timing common to the calculation nodes;a retention control unit that retains the job information in a retention unit of the one of the calculation nodes in association with an identification number identifying the period timing at which the job information is acquired by the acquisition unit, and clears all the job information retained in the retention unit when a clear request is received from the management node; andan information transmission unit that, when a transmission request for the job information about a designated identification number is received, transmits the job information about the designated identification number to the management node in a case where the job information about the ...

AUTOMATED TEST CYCLE ESTIMATION SYSTEM AND METHOD

A system and method is disclosed to estimate both, the time and number of resources required to execute a test suite or a subset of test suite in parallel, with the objective of providing a balanced workload distribution. The present invention partitions test suite for parallelization, given the dependencies that exists between test cases and test execution time. 1) A computer implemented method of constraint estimation during execution of plurality of test cycle , the method having computer executable code tangibly embodied on a computer readable storage medium and comprising:receiving the constraints determining execution of the test cycles, a set of test cases in the each test cycle and one or more test cases selected from the set of test cases;constructing a first associated dependence graph for the test cases and a second dependence sub graph for the selected test cases within the each test cycle for determining one or more corresponding disconnected components and the associated component weights;performing balanced distribution of the identified disconnected components across one or more partition based on the received constraint such that difference between maximum and minimum partitions is minimal for resource as a constraint, and the partitions are executed within a given time for time as a constraint; andcomputing estimation efficiency of the constraints based on the created partitions.2) The method of claim 1 , wherein the constraints include total time for executing the test cycle or resource availability for the each test cycle.3) The method of claim 2 , wherein the resource availability can be partial or full for the each test cycle.4) The method of claim 1 , wherein the test cases are received along with their respective weights and the selected test cases therefrom claim 1 , the weights representative of test case execution time.5) The method of claim 1 , wherein the selection of the test cases is based on execution dependency amongst the test cases ...

Method and apparatus for graphic processing using multi-threading

A method and apparatus for graphic processing using multi-threading are provided. At least one context task, mediation task, and control task are executed by a processor. The at least one context task sequentially generates graphic commands. The mediation task mediates processing of the graphic commands. The mediation task may process a particular graphic command on behalf of the at least one context task, and change a processing order of the graphic commands. The control task transmits the graphic commands to a graphic hardware.

APPARATUS, SYSTEM, CONTROL METHOD AND PROGRAM FOR IMAGE PROCESSING

The present invention is intended for properly receiving set data in setting items of a series of processes. The present invention solves the problem by controlling to determine whether the setting item of the unique processing information and the setting item of the shared processing information are identical, to generate, when the setting items are determined to be identical and when a setting item for which set data is different in the unique and shared processing information is identified, template processing information including information indicating the identified setting item and the setting item of the shared processing information, and to store the template processing information, and by displaying a user interface receiving the set data of the identified setting item from among the setting items of the template processing information at the time of generating new unique processing information by using the template processing information. 1. An image processing apparatus that receives from an external apparatus unique processing information that is unique to a user and includes a setting item of a series of processes and shared processing information that is shared by a user and includes a setting item of a series of processes , comprising:a control unit configured to controldetermination of whether or not the setting item of the unique processing information and the setting item of the shared processing information are identical,generation of, when the setting items are determined to be identical and when a setting item for which set data is different in the unique processing information and the shared processing information is identified, template processing information including information indicating the identified setting item and the setting item of the shared processing information, andstorage of the template processing information in a storage unit; anda display unit configured to display a user interface on a display, the user interface receiving ...

MANAGING JOB EXECUTION

A method for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system. 1. A method of managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system comprising:intercepting, by a data processing system, jobs scheduled for execution in the target system;determining whether there is resource sufficiency in the target system for executing jobs;responsive to an affirmative determination of resource sufficiency, releasing by the data processing system previously intercepted jobs for execution in the target system;computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system; andtransmitting the computed limit to the external system.2. The method of further comprising identifying whether there are any new jobs scheduled for execution by the target system and determining whether any new jobs may be intercepted prior to intercepting jobs wherein computing the limit is responsive to a negative determination of new jobs that may be intercepted.3. The method of further comprising determining whether there are any jobs scheduled for execution by the target system wherein computing the limit is responsive to a negative determination of any jobs scheduled for execution.6. The method of wherein computing at this t time comprises using as f claim 4 , the Exponential Moving Average ...

Preventing classification of object contextual information

Technology is disclosed for preventing classification of objects, e.g., in an augmented reality system. The technology can identify a set of objects to be classified, determine whether context information for one or more objects in the identified set of objects to be classified is identified as not to be employed during classifiation, and during classification of two different objects, include context information for one object but not the other.

Simulation control techniques

Simulation control techniques include shutting down peer processes and user code modules, storing an image of a simulation as a checkpoint after the peer processes and user code modules are shutdown, and re-starting user code modules and peer processes after storing an image of the simulation. The resulting checkpoint and processes can be used for restoring from a checkpoint or restarting a new simulation environments having peer processes such as debuggers coupled to the simulation.

Transparent high availability for stateful services

One embodiment of the present invention provides a system. The system includes a high availability module and a data transformation module. During operation, the high availability module identifies a modified object belonging to an application in a second system. A modification to the modified object is associated with a transaction identifier. The high availability module also identifies a local object corresponding to the modified object associated with a standby application corresponding to the application in the second system. The data transformation module automatically transforms the value of the modified object to a value assignable to the local object, including pointer conversion to point to equivalent object of the second system. The high availability module updates the current value of the local object with the transformed value.

Storage system for atomic write of one or more commands

Storage systems which allow atomic write operations, methods of operating thereof, and corresponding computer program products. By way of non-limiting example, a possible method includes: receiving indication of a transaction, where a plurality of blocks directed to at least one destination logical volume and relating to at least one command is to be written as an atomic write operation; generating a transaction identifier number for the transaction; enabling tracking of the transaction at least partly based on the transaction identifier number, including temporary location of any one of the plurality of blocks; accommodating at least one block of the plurality temporarily in the storage system; and upon receiving an indication that all blocks in the plurality have been successfully temporarily accommodated in the storage system, enabling data corresponding to the plurality of blocks to subsequently be stored in the at least destination logical volume and discontinuing tracking of the transaction.

Major branch instructions

Major branch instructions are provided that enable execution of a computer program to branch from one segment of code to another segment of code. These instructions also create a new stream of processing at the other segment of code enabling execution of the other segment of code to be performed in parallel with the segment of code from which the branch was taken. In one example, the other stream of processing starts a transaction for processing instructions of the other stream of processing.

Major branch instructions

Major branch instructions are provided that enable execution of a computer program to branch from one segment of code to another segment of code. These instructions also create a new stream of processing at the other segment of code enabling execution of the other segment of code to be performed in parallel with the segment of code from which the branch was taken. In one example, the other stream of processing starts a transaction for processing instructions of the other stream of processing.

Low-Power Multi-Standard Cryptography Processing Units with Common Flip-Flop/Register Banks

A method, system, and apparatus for managing a plurality of cipher processor units. A cipher module may receive a cipher instruction indicating a cipher algorithm to be used. The cipher module may identify a cipher processing unit of the plurality of cipher processing units associated with the cipher algorithm. The cipher module may execute the cipher instruction using the cipher processing unit and the common register array. The cipher module may store a state of a common register array to be used by the cipher processing unit of the plurality of cipher processing units.

Managing transactions within a middleware container

A computer collects first test metrics on a transaction hosted within a middleware container, and is executing within a first environment. The computer generates baseline values of expected execution behavior of the transaction based on the first test metrics. The computer collects second test metrics on the transaction hosted within the middleware container, and is executing within a second environment. The computer compares the second test metrics to the baseline values. The computer determines whether the second test metrics satisfy the baseline values. In response to the second test metrics not satisfying the baseline values, the computer identifies the transaction as a candidate for cancellation.

SPECULATIVE THREAD EXECUTION WITH HARDWARE TRANSACTIONAL MEMORY

In an embodiment, if a self thread has more than one conflict, a transaction of the self thread is aborted and restarted. If the self thread has only one conflict and an enemy thread of the self thread has more than one conflict, the transaction of the self thread is committed. If the self thread only conflicts with the enemy thread and the enemy thread only conflicts with the self thread and the self thread has a key that has a higher priority than a key of the enemy thread, the transaction of the self thread is committed. If the self thread only conflicts with the enemy thread, the enemy thread only conflicts with the self thread, and the self thread has a key that has a lower priority than the key of the enemy thread, the transaction of the self thread is aborted. 1. A computer-readable storage medium encoded with instructions , wherein the instructions when executed comprise:if a self thread has more than one conflict, aborting and restarting a transaction of the self thread;if the self thread has only one conflict and an enemy thread of the self thread has more than one conflict, committing the transaction of the self thread;if the self thread only conflicts with the enemy thread and the enemy thread only conflicts with the self thread and the self thread has a key that has a higher priority than a key of the enemy thread, committing the transaction of the self thread; andif the self thread only conflicts with the enemy thread and the enemy thread only conflicts with the self thread and the self thread has a key that has a lower priority than the key of the enemy thread, aborting the transaction of the self thread.2. The computer-readable storage medium of claim 1 , further comprising:if the transaction of the self thread has been aborted more than a threshold number of times, increasing a priority of the key of the self thread.3. The computer-readable storage medium of claim 2 , further comprising:if the priority of the key of the self thread exceeds a ...

INSTRUCTION AND LOGIC TO TEST TRANSACTIONAL EXECUTION STATUS

Novel instructions, logic, methods and apparatus are disclosed to test transactional execution status. Embodiments include decoding a first instruction to start a transactional region. Responsive to the first instruction, a checkpoint for a set of architecture state registers is generated and memory accesses from a processing element in the transactional region associated with the first instruction are tracked. A second instruction to detect transactional execution of the transactional region is then decoded. An operation is executed, responsive to decoding the second instruction, to determine if an execution context of the second instruction is within the transactional region. Then responsive to the second instruction, a first flag is updated. In some embodiments, a register may optionally be updated and/or a second flag may optionally be updated responsive to the second instruction. 1. A computer implemented method comprising:decoding an instruction to test a transactional status; andexecuting the decoded instruction to determine if the execution context is within a transactional region.2. The computer implemented method of wherein responsive to said executing the decoded instruction claim 1 , setting a register to a second value indicative of a nesting level of the transactional region.3. The computer implemented method of wherein responsive to said executing the decoded instruction claim 1 , setting a flag to a first value if the instruction is executed within a transactional region.4. The computer implemented method of wherein the flag is set to the first value of zero if the instruction is executed within a transactional region.5. The computer implemented method of wherein responsive to said executing the decoded instruction claim 3 , setting the flag to a second value if the instruction is not executed within a transactional region.6. The computer implemented method of wherein the flag is set to the second value of one if the instruction is not executed ...

Instruction set architecture-based inter-sequencer communications with a heterogeneous resource

In one embodiment, the present invention includes a method for directly communicating between an accelerator and an instruction sequencer coupled thereto, where the accelerator is a heterogeneous resource with respect to the instruction sequencer. An interface may be used to provide the communication between these resources. Via such a communication mechanism a user-level application may directly communicate with the accelerator without operating system support. Further, the instruction sequencer and the accelerator may perform operations in parallel. Other embodiments are described and claimed.

Exception handling in a data processing apparatus having a secure domain and a less secure domain

Processing circuitry can operate in a secure domain and a less secure domain. In response to an initial exception from background processing performed by the processing circuitry, state saving of data from a first subset of registers is performed by exception control circuitry before triggering an exception handling routine, while the exception handling routine has responsibility for performing state saving of data from a second subset of registers. In response to a first exception causing a transition from the secure domain from a less secure domain, where the background processing was in the less secure domain, the exception control circuitry performs additional state saving of data from the second set of registers before triggering the exception handling routine. In response to a tail-chained exception causing a transition from the secure domain to the less secure domain, the exception handling routine is triggered without performing an additional state saving.

Apparatus and method for memory overlay

A memory overlay apparatus includes an internal memory that includes a dirty bit indicating a changed memory area, a memory management unit that controls an external memory to store only changed data so that only data actually being used by a task during overlay is stored and restored, and a direct memory access (DMA) management unit that confirms the dirty bit when the task is changed and that moves a data area of the task between the internal memory and the external memory.

Shared resources in a docked mobile environment

A first and second data handling systems provides for shared resources in a docked mobile environment. The first data handling system maintains a set of execution tasks within the first data handling system having a system dock interface to physically couple to the second data handling system. The first data handling system assigns a task to be executed by the second data handling system while the two systems are physically coupled.

PERSISTENT DATA STORAGE TECHNIQUES

A database is maintained that stores data persistently. Tasks are accepted from task sources. At least some of the tasks have competing requirements for use of regions of the database. Each of the regions includes data that is all either locked or not locked for writing at a given time. Each of the regions is associated with an available processor. For each of the tasks, jobs are defined each of which requires write access to regions that are to be accessed by no more than one of the processors. Jobs are distributed for concurrent execution by the associated processors. 1. A method comprisingmaintaining a database that stores data persistently,accepting jobs for concurrent execution by processors, the jobs requiring access to data in the database, andcausing each of the processors to execute at least some of the jobs, by accessing the data in the database, other than in the order in which the jobs are received for execution, the jobs being assigned to the processors based on characteristics of items of the data to be accessed by the database.2. The method of in which the items of the data comprise objects in an object database.3. The method of in which the items of the data are provided as objects to an object-oriented application.43. The method of claim 1 , claim 1 , or in which the at least some of the jobs to be executed by one of the processors are replaced by a single aggregated job.5. The method of in which the jobs that are replaced have been pre-identified as requiring execution as a synchronization group to ensure correctness of results claim 4 , all of the jobs of the synchronization group being associated with information that identifies them as members of the group and defines their respective fractions of a quorum.63. The method of claim 4 , claim 4 , or in which each of the processors determines an order in which to process at least some of the jobs based on physical locations on disk of the data that must be accessed by the jobs.7. The method of in ...

METHOD AND APPARATUS FOR IMPLEMENTING A TRANSACTIONAL STORE SYSTEM USING A HELPER THREAD

A method, apparatus, and computer readable article of manufacture for executing a transaction by a processor apparatus that includes a plurality of hardware threads. The method includes the steps of: executing, by the processor apparatus using the plurality of hardware threads, a main software thread for executing the transaction and a helper software thread for executing a barrier function; and deciding, by the processor apparatus, whether or not the barrier function is required to be executed when the main software thread encounters a transactional load or store operation that requires the main software thread to read or write data. 1. A method for executing a transaction by a processor apparatus that includes a plurality of hardware threads , the method comprising the steps of:executing, by the processor apparatus using the plurality of hardware threads, a main software thread for executing the transaction and a helper software thread for executing a barrier function; anddeciding, by the processor apparatus, whether or not the barrier function is required to be executed when the main software thread encounters a transactional load or store operation that requires the main software thread to read or write data.2. The method according to claim 1 , further comprising:executing the barrier function by the helper software thread, wherein the step of executing the barrier function includes: stalling the main software thread; activating the helper software thread to execute the barrier function; and exiting the helper software thread in response to the completion of the execution; andreturning to the main software thread, thereby executing the transaction by the processor apparatus.3. The method according to claim 1 , wherein each of the plurality of hardware threads comprises write-signature for saving a physical address of data written or read-signature for saving a physical address of data read by the main software thread.4. The method according to claim 3 , wherein ...

Context state management for processor feature sets

Embodiments of an invention related to context state management based on processor features are disclosed. In one embodiment, a processor includes instruction logic and state management logic. The instruction logic is to receive a state management instruction having a parameter to identify a subset of the features supported by the processor. The state management logic is to perform a state management operation specified by the state management instruction.

Transaction processing system and method

According to one example of the present invention, there is provided a transaction processing system. The transaction processing system comprises a transaction analyzer for determining characteristics of a received transaction, a processing agent selector for selecting, based on the determined characteristics, a processing agent for processing the received transaction, and a dispatcher for dispatching the received transaction and the selected processing agent to a processing resource to cause the transaction to be processed in accordance with the selected processing agent on at least one of the computing devices.

COMPUTER SYSTEM, JOB EXECUTION MANAGEMENT METHOD, AND PROGRAM

In a computer system of the present invention, whether or not master data has been updated is managed for each division key as master data management information. If the master data has been updated, a job is re-executed, but when the job is re-executed, data is divided using only a division key corresponding to updated master data, and thereby a sub-job which is a re-execution target is localized with the division key unit so as to re-execute a job (refer to FIG. ). 1. A computer system comprising:a plurality of job execution computers that execute a job;a management computer that generates a plurality of divided data items by dividing master data using a division key indicating the division unit of the master data, and sets a job execution computer which applies a job net to each of the plurality of divided data items so as to execute a sub-job; andat least one storage device that stores at least the master data and an execution result of the sub-job,wherein the management computermanages update related information regarding whether or not the master data has been updated and updated division key information which is a division key corresponding to an updated portion;specifies a divided data item corresponding to the updated division key information from the plurality of divided data items when the master data is updated after execution of the sub-job or during the execution of the sub-job; andinstructs the job execution computer to apply the job net only on the divided data items which has been specified so as to re-execute a sub-job, andwherein the job execution computer re-executes the sub-job only on the divided data item which has been specified in response to the sub-job execution instruction from the management computer.2. The computer system according to claim 1 ,wherein the management computer manages multiplicity of vacancies information indicating whether or not there is a capacity for executing a sub-job in each of the plurality of job execution ...

Computer program product, and information processing apparatus and method

According to an embodiment, a computer program product includes a computer-readable medium including program, when executed by a computer, to have a plurality of modules run by the computer. The computer includes a memory having a shared area, which is an area accessible to only those modules which run cooperatively and storing therein execution module identifiers. Each of the modules includes a first operation configured to store, just prior to a switchover of operations to an other module that runs cooperatively, an identifier of the other module as the execution module identifier in the shared area; and a second operation configured to execute, when the execution module identifier stored in the shared area matches with an identifier of own module immediately after a switchover of operations from the other module, a function inside the own module.

Connection Leasing for Hosted Services

Aspects herein describe brokering hosted resources in a virtual desktop infrastructure (VDI) using connection leases to reduce demand on connection brokers and to allow hosted services to be maintained even in the event of a broker outage. When a client device desires to connect to a hosted resource (e.g., a hosted desktop or a hosted application), the client device may present a lease token to the session host. The lease token is a self-sustaining package of data from which a session host can determine whether the requesting client device is authorized to access one or more resources hosted by that session host. The lease token may be cryptographically signed to ensure its contents have not been altered, and further that the lease token originated from a trusted source. Lease tokens may be stored independently from a connection broker, thereby still being usable if the connection broker goes offline