Time filter

Source Type

Grant
Agency: European Commission | Branch: H2020 | Program: RIA | Phase: ICT-07-2014 | Award Amount: 6.94M | Year: 2015

The SSICLOPS project will focus on techniques for the management of federated private cloud infrastructures, in particular cloud networking techniques (within software-defined data centres and across wide-area networks). Key deliverables from the project will include a meta data description language for workloads, resources and policies, a flexible scheduling system using meta data, workload-specific adaptations to TCP/IP stacks, and data center performance analysis tools. Addressing topics, such as dynamic configuration, automated provisioning and orchestration of cloud resources the SSICLOPS projects will investigate high-performance, vertically integrated network stacks for intra/inter-cloud communication and efficient, scalable, and secure intra/inter-DC and client-facing transport mechanisms. The project will design, implement, demonstrate, and evaluate three specific use cases, namely a cloud-based in-memory database, the analysis of physics experiment data, and the prototypical extension of network stacks for a telecom provider in the SSICLOPS testbed.


Grant
Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2011.6.7 | Award Amount: 5.10M | Year: 2012

The Service Platform for Green European Transportation provides transportation planners and drivers of transportation vehicles with the means to plan, re-plan and control transportation routes efficiently and in a manner that reduces CO2 emission.Currently, basic systems for transportation and route planning exist. The GET Service platform lifts these systems to the next major level, by:1. enabling improved transportation and route planning, by incorporating transportation- and logistics-related tasks, such as transfer of goods and administrative tasks, into the planning;2. facilitating more accurate transportation and route planning, by using real-time information from multiple information sources;3. facilitating quick effectuation of changes to transportation plans, including the execution of necessary transportation-related tasks, such as (de-)reservation of necessary resources and unloading of already loaded goods;4. enabling holistic planning, where transportation routes and placement of transportation resources is planned jointly to optimize resource usage.To achieve these objectives, the GET Service platform is developed, with subsystems for information aggregation, real-time planning, transportation control and transportation service development. The GET Service platform contributes to the state of the art, by providing: novel real-time transportation planning algorithms; a transportation-specific service development subsystem, transportation control and reconfiguration mechanisms; and automated real-time information aggregation mechanisms.A prototype of the GET Service platform will be implemented, along with a collection of information provisioning services and end-user services for transportation planners and drivers of transportation vehicles. With this prototype the platforms practical applicability to reduce CO2 emission will be validated, by solving usage scenarios related to co-modality, synchro-modality and resource distribution.


Patent
Hasso Plattner Institute fur Softwaresystemtechnik GmbH | Date: 2011-10-07

A system and method of determining an earliest delivery date for a demand on the basis of a fact table stored in a database, where the demand indicates both a desired date and a desired quantity for items from a stock, where a fact time series is comprised by and/or deducible from the fact table, and where the fact time series comprises fact tuples indicating both a fact date and a change in quantity of stock items that occurred on this fact date. The method includes generating an aggregated time series from the fact time series by defining and/or obtaining discrete time intervals, and generating, for at least one discrete time interval, an aggregated tuple indicating both its corresponding discrete time interval and the aggregated change in quantity of stock items that occurred in its corresponding discrete time interval.


Patent
Hasso Plattner Institute fur Softwaresystemtechnik GmbH | Date: 2013-11-08

A system and method of determining an earliest delivery date for a demand on the basis of a fact table stored in a database, where the demand indicates both a desired date and a desired quantity for items from a stock, where a fact time series is comprised by and/or deducible from the fact table, and where the fact time series comprises fact tuples indicating both a fact date and a change in quantity of stock items that occurred on this fact date. The method includes generating an aggregated time series from the fact time series by defining and/or obtaining discrete time intervals, and generating, for at least one discrete time interval, an aggregated tuple indicating both its corresponding discrete time interval and the aggregated change in quantity of stock items that occurred in its corresponding discrete time interval.


Patent
Hasso Platt ner Institute fur Softwaresystemtechnik GmbH | Date: 2014-08-20

The present invention provides methods and system, including computer program products, implementing and using techniques for providing tasks of different classes with access to CPU time provided by worker threads of a database system. In particular, the invention relates to such a database-system-implemented method comprising the following steps: inserting the tasks to a queue of the database system; and executing the tasks inserted to the queue by worker threads of the database system according to their order in the queue; characterized in that the queue is a priority queue; and in that the method further comprises the following steps: assigning each class to a respective priority; and in that the step of inserting the tasks to the queue includes: associating each task with the respective priority assigned to its class.


Patent
HASSO PLATTNER Institute FUR SOFTWARESYSTEMTECHNIK GMBH | Date: 2013-03-05

A system and method that dynamically adapts to workload changes and adopts the best possible physical layout on the flywhile allowing simultaneous updates to the table. A process continuously and incrementally computes the optimal physical layout based on workload changes and determines whether or not switching to this new layout would be beneficial. The system can perform online reorganization of hybrid main memory databases with a negligible overheard, leading up to three orders of magnitude performance gains when determining the optimal layout of dynamic workloads and providing guarantees on the worst case performance of our system.


Patent
Hasso Plattner Institute fur Softwaresystemtechnik GmbH | Date: 2011-12-28

In general, methods and apparatus, including computer program products, implementing and using techniques for providing a discovery service in a unique identifier network are described. Said discovery service is suitable for tracking and tracing a query item represented by a unique identifier in a unique identifier network. In particular, a search method for a containment-aware discovery service is described.


Patent
Hasso Plattner Institute fur Softwaresystemtechnik GmbH | Date: 2011-12-28

In general, methods and apparatus, including computer program products, implementing and using techniques for providing a discovery service in a unique identifier network are described. Said discovery service is suitable for tracking and tracing a query item represented by a unique identifier in a unique identifier network. In particular, a filter method for a containment-aware discovery service is described.


Patent
Hasso Plattner Institute Fur Softwaresystemtechnik GmbH | Date: 2010-06-30

The invention relates to a computer-implemented method for dynamically and horizontally partitioning a table of a relational database, wherein the table comprises records, wherein the records are mapped to a plurality of states, wherein the table is horizontally partitioned into a plurality of partitions, and wherein the plurality of states is mapped to the plurality of partitions. The method comprises the steps of changing the assignment of a first record from a first state to a second state, wherein the first state is mapped to a first partition, wherein the second state is mapped to a second partition, wherein the first partition is not the second partition, and storing the first record in the second partition. The invention further relates to a computer system implementing the abovementioned method for dynamically and horizontally partitioning a table of a relational database.


Patent
Hasso Plattner Institute Fur Softwaresystemtechnik GmbH | Date: 2010-06-30

The invention relates to a computer-implemented method for operating a database comprising the step of updating a binary status of a tuple in the database. The binary status field either contains a null value or a time stamp. The update can be done in-place or by using an insert-only approach.

Loading Hasso Plattner Institute fur Softwaresystemtechnik GmbH collaborators
Loading Hasso Plattner Institute fur Softwaresystemtechnik GmbH collaborators