{"id":175,"date":"2016-09-11T11:12:30","date_gmt":"2016-09-11T10:12:30","guid":{"rendered":"http:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/?p=175"},"modified":"2017-03-27T14:56:30","modified_gmt":"2017-03-27T13:56:30","slug":"scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management","status":"publish","type":"post","link":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/","title":{"rendered":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management"},"content":{"rendered":"<p><strong>Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management<\/strong><br \/>\nAn automatic run-time optimisation system has been developed that allows programmers to ignore non-uniformity in parallel computing systems without sacrificing performance.<\/p>\n<p>The research was conducted by an international team of computer scientists led from the University of Manchester. The resulting system allows software engineers to harness the ever-increasing power of contemporary computing systems without being exposed to their complexity. The system is automatic, application-independent, performance-portable across machines, and adapts seamlessly to dynamic changes.<\/p>\n<p>While computing devices have become faster and more energy-efficient every year, this capability is often not translated into faster and more efficient applications for users. This is due to the difficulty of writing programs that can cope with the significant static and dynamic non-uniformity in modern computing systems. The optimization strategy uses semantic program information, gathered during compilation, to make precise scheduling and memory placement decisions at run time. This dynamic approach allows the preservation of a uniform hardware abstraction for programmers, leaving the work of managing non-uniformity to an automated run-time system.<\/p>\n<p>It is anticipated that this research will influence the key trade-offs that determine how computing systems are designed and, eventually, lead to significant changes in the way software is deployed and optimised in future computing systems.<\/p>\n<div class=\"abstract-box\">\n<ul>\n<li>Computing systems use more time and energy moving data around than on computing.<\/li>\n<li>The impact of this research on distributed systems is expected to be even more important because of the exacerbated costs of data movement.<\/li>\n<li>A key factor to the success of this research is the concurrent development of the Aftermath (https:\/\/www.aftermath-tracing.com\/) program analysis tool at The University of Manchester. This tool allowed a much finer understanding of the behaviour of programs and their interaction with the hardware.<\/li>\n<\/ul>\n<p><\/div><br \/>\n<p class=\"button\"><a target=\"blank\" href=\"http:\/\/dl.acm.org\/citation.cfm?doid=2967938.2967946\" class=\"uom-button\">Click here to read the full article - DOI: 10.1145\/2967938.2967946<\/a><\/p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management An automatic run-time optimisation system has been developed that allows programmers to ignore non-uniformity in parallel computing systems without sacrificing performance. The research was conducted by an international team of computer scientists led from the University of Manchester. The resulting system [&hellip;]<\/p>\n","protected":false},"author":19,"featured_media":505,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_genesis_hide_title":false,"_genesis_hide_breadcrumbs":false,"_genesis_hide_singular_image":false,"_genesis_hide_footer_widgets":false,"_genesis_custom_body_class":"","_genesis_custom_post_class":"","_genesis_layout":"","_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[4,15],"tags":[],"class_list":{"0":"post-175","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-computer-science","8":"category-edition-02","9":"entry"},"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract\" \/>\n<meta property=\"og:description\" content=\"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management An automatic run-time optimisation system has been developed that allows programmers to ignore non-uniformity in parallel computing systems without sacrificing performance. The research was conducted by an international team of computer scientists led from the University of Manchester. The resulting system [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/\" \/>\n<meta property=\"og:site_name\" content=\"In Abstract\" \/>\n<meta property=\"article:published_time\" content=\"2016-09-11T10:12:30+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2017-03-27T13:56:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"890\" \/>\n\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"Dave Espley\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Dave Espley\" \/>\n\t<meta name=\"twitter:label2\" content=\"Estimated reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/\"},\"author\":{\"name\":\"Dave Espley\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/#\\\/schema\\\/person\\\/95999b41ac9e7db8ffd7d64b7b69d13c\"},\"headline\":\"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management\",\"datePublished\":\"2016-09-11T10:12:30+00:00\",\"dateModified\":\"2017-03-27T13:56:30+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/\"},\"wordCount\":333,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/wp-content\\\/uploads\\\/sites\\\/61\\\/2017\\\/02\\\/Drebes.jpg\",\"articleSection\":[\"Computer Science\",\"Edition 02\"],\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/\",\"url\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/\",\"name\":\"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/wp-content\\\/uploads\\\/sites\\\/61\\\/2017\\\/02\\\/Drebes.jpg\",\"datePublished\":\"2016-09-11T10:12:30+00:00\",\"dateModified\":\"2017-03-27T13:56:30+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/#\\\/schema\\\/person\\\/95999b41ac9e7db8ffd7d64b7b69d13c\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#breadcrumb\"},\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/wp-content\\\/uploads\\\/sites\\\/61\\\/2017\\\/02\\\/Drebes.jpg\",\"contentUrl\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/wp-content\\\/uploads\\\/sites\\\/61\\\/2017\\\/02\\\/Drebes.jpg\",\"width\":890,\"height\":350,\"caption\":\"The effects of run-time optimisation on use of CPU time\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/#website\",\"url\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/\",\"name\":\"In Abstract\",\"description\":\"The latest papers from The University of Manchester Faculty of Science and Engineering\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/#\\\/schema\\\/person\\\/95999b41ac9e7db8ffd7d64b7b69d13c\",\"name\":\"Dave Espley\",\"url\":\"https:\\\/\\\/www.mub.eps.manchester.ac.uk\\\/in-abstract\\\/author\\\/daveespley\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/","og_locale":"en_GB","og_type":"article","og_title":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract","og_description":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management An automatic run-time optimisation system has been developed that allows programmers to ignore non-uniformity in parallel computing systems without sacrificing performance. The research was conducted by an international team of computer scientists led from the University of Manchester. The resulting system [&hellip;]","og_url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/","og_site_name":"In Abstract","article_published_time":"2016-09-11T10:12:30+00:00","article_modified_time":"2017-03-27T13:56:30+00:00","og_image":[{"width":890,"height":350,"url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","type":"image\/jpeg"}],"author":"Dave Espley","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Dave Espley","Estimated reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#article","isPartOf":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/"},"author":{"name":"Dave Espley","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/#\/schema\/person\/95999b41ac9e7db8ffd7d64b7b69d13c"},"headline":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management","datePublished":"2016-09-11T10:12:30+00:00","dateModified":"2017-03-27T13:56:30+00:00","mainEntityOfPage":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/"},"wordCount":333,"commentCount":0,"image":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#primaryimage"},"thumbnailUrl":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","articleSection":["Computer Science","Edition 02"],"inLanguage":"en-GB","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/","url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/","name":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management - In Abstract","isPartOf":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#primaryimage"},"image":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#primaryimage"},"thumbnailUrl":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","datePublished":"2016-09-11T10:12:30+00:00","dateModified":"2017-03-27T13:56:30+00:00","author":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/#\/schema\/person\/95999b41ac9e7db8ffd7d64b7b69d13c"},"breadcrumb":{"@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#breadcrumb"},"inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/"]}]},{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#primaryimage","url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","contentUrl":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","width":890,"height":350,"caption":"The effects of run-time optimisation on use of CPU time"},{"@type":"BreadcrumbList","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/scalable-task-parallelism-for-numa-a-uniform-abstraction-for-coordinated-scheduling-and-memory-management\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/"},{"@type":"ListItem","position":2,"name":"Scalable Task Parallelism for NUMA: A Uniform Abstraction for Coordinated Scheduling and Memory Management"}]},{"@type":"WebSite","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/#website","url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/","name":"In Abstract","description":"The latest papers from The University of Manchester Faculty of Science and Engineering","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-GB"},{"@type":"Person","@id":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/#\/schema\/person\/95999b41ac9e7db8ffd7d64b7b69d13c","name":"Dave Espley","url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/author\/daveespley\/"}]}},"jetpack_featured_media_url":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-content\/uploads\/sites\/61\/2017\/02\/Drebes.jpg","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/posts\/175","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/users\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/comments?post=175"}],"version-history":[{"count":9,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/posts\/175\/revisions"}],"predecessor-version":[{"id":400,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/posts\/175\/revisions\/400"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/media\/505"}],"wp:attachment":[{"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/media?parent=175"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/categories?post=175"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.mub.eps.manchester.ac.uk\/in-abstract\/wp-json\/wp\/v2\/tags?post=175"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}