| Nov. 27, 2023, 2:13 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 20, 2023, 2:03 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 13, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 6, 2023, 1:31 p.m. |
Added
35
|
{"external_links": []}
|
|
| Aug. 14, 2023, 1:31 p.m. |
Added
35
|
{"external_links": []}
|
|
| Aug. 7, 2023, 1:32 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 31, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 24, 2023, 1:36 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 17, 2023, 1:35 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 10, 2023, 1:26 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 3, 2023, 1:27 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 26, 2023, 1:26 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 19, 2023, 1:27 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 12, 2023, 1:30 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 5, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 29, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 22, 2023, 1:29 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 15, 2023, 1:32 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 8, 2023, 1:38 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 1, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 24, 2023, 1:35 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 17, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 10, 2023, 1:25 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 3, 2023, 1:27 p.m. |
Added
35
|
{"external_links": []}
|
|
| Jan. 28, 2023, 11:09 a.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 30069, "fields": {"project": 7290, "organisation": 2, "amount": 191306, "start_date": "2010-09-30", "end_date": "2014-03-30", "raw_data": 48925}}]
|
|
| Jan. 28, 2023, 10:52 a.m. |
Added
35
|
{"external_links": []}
|
|
| April 11, 2022, 3:48 a.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 22205, "fields": {"project": 7290, "organisation": 2, "amount": 191306, "start_date": "2010-09-30", "end_date": "2014-03-30", "raw_data": 33685}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 84030, "fields": {"project": 7290, "organisation": 52, "role": "LEAD_ORG"}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 52020, "fields": {"project": 7290, "person": 267, "role": "PI_PER"}}]
|
|
| April 11, 2022, 1:48 a.m. |
Updated
35
|
{"title": ["", "Novel Asynchronous Algorithms and Software for Large Sparse Systems"], "description": ["", "\nThe solution of large sparse systems, both linear and nonlinear is a key numerical technology underpinning many areas of computational science and engineering, including climate and environmental modelling, nuclear fusion, materials science and computational chemistry. The reliance of these and other application domains on sparse system solution means that they all face difficulties in achieving extreme scalability, since the underlying algorithms are highly synchronous. This project aims to develop more scalable numerical methods through the use of asynchronous iterative algorithms. In asynchronous iterations, the order in which components of the solution are updated is arbitrary and the past values of components that are used in the updates are also selected arbitrarily. This is a model for parallel computation in which different processors work independently and have access to data values in local memory. Coping with fault tolerance, load balancing, and communication overheads in a heterogeneous computation environment is a challenging undertaking for software development. In traditional synchronous algorithms each iteration can only be performed as quickly as the slowest processor permits. If a processor fails, or is less capable, or has an unduly heavy load, then this markedly impacts on iteration times. The use of asynchronous methods allows one to overcome many of the communication, load balancing and fault tolerance issues we now face and which limit our ability to scale to the extreme.An important feature of this project is the close coupling throughout the development of algorithms and software with the needs of two exemplar applications, along with the deployment and testing of prototypes in these applications. The applications are the design optimization of orthopaedic and dental implants and SmartGrids within power systems. Both applications need improved algorithms in order to solve their challenging problems on future parallel systems and they present linear systems with different characteristics, thus providing both a useful test bed for the software and a means to demonstrate during the project the benefits of the new algorithms.\n\n"], "extra_text": ["", "\n\n\n\n"], "status": ["", "Closed"]}
|
|
| April 11, 2022, 1:48 a.m. |
Added
35
|
{"external_links": [26487]}
|
|
| April 11, 2022, 1:48 a.m. |
Created
35
|
[{"model": "core.project", "pk": 7290, "fields": {"owner": null, "is_locked": false, "coped_id": "3fce6db5-227d-4bf7-805d-c30896af2488", "title": "", "description": "", "extra_text": "", "status": "", "start": null, "end": null, "raw_data": 33669, "created": "2022-04-11T01:45:13.654Z", "modified": "2022-04-11T01:45:13.654Z", "external_links": []}}]
|
|