{"payload":{"header_redesign_enabled":false,"results":[{"id":"307734376","archived":false,"color":"#3572A5","followers":1,"has_funding_file":false,"hl_name":"LukeANewton/rate-monotonic-scheduler","hl_trunc_description":"Simulate RMS for N periodic, perfectly preemptable processes on M identical processors","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":307734376,"name":"rate-monotonic-scheduler","owner_id":28909353,"owner_login":"LukeANewton","updated_at":"2020-10-27T15:29:09.664Z","has_issues":true}},"sponsorable":false,"topics":["python","python3","real-time-scheduling","rate-monotonic"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":63,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253ALukeANewton%252Frate-monotonic-scheduler%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/LukeANewton/rate-monotonic-scheduler/star":{"post":"SqV84B7Q5XBRxTrbr5kQEhTe-xlKj_0D1RAZCVrh0pOh4zFWddULIFigDggKB0otrrzIgKJQsTqaJkXD2VS0gg"},"/LukeANewton/rate-monotonic-scheduler/unstar":{"post":"z9eEjLDJQ8knfzVqWe_XG6xbLTjzD9Wx4D1MQpwHD4WaVBsGrS9LFjlpI_xcudS0n4VkKo53Xlvgu65_gNcKzA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"UPey2YLZMHSMMToVuTYiKDw-HBXLzOeeAOS56B4DOSb3uEBlfO4iHx3zcFe5ekH91Jb7uaOzPmDodTXimjabkg"}}},"title":"Repository search results"}